PDF (276 K) - Growing Science
PDF (276 K) - Growing Science
PDF (276 K) - Growing Science
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
336<br />
Tavakkoli-Moghaddam, R., Moslehi, G., Vasei, M., & Azaron, A. (2006). A branch-and-bound<br />
algorithm for a single machine sequencing to minimize the sum of maximum earliness and<br />
tardiness with idle insert. Applied Mathematics and Computation 174, 388-408.<br />
Ventura, J.A., & Weng, M.X. (1994). Single-machine scheduling for minimizing total cost with<br />
identical, asymmetrical earliness and tardiness penalties. International Journal of Production<br />
Research 32, 2725–2729.<br />
Wan, G., & Yen, B.P.C. (2002). Tabu search for single machine with distinct due windows and<br />
weighted earliness/tardiness penalties. European Journal of Operational Research 142, 271-281.<br />
Wan, G., & Yen, B.P.-C. (2009). Single machine scheduling to minimize total weighted earliness<br />
subject to minimal number of tardy jobs. European Journal of Operational Research 195, 89-97.
Change language