References
- [1] Aldowaisan, T., and Allahverdi, A. No-wait flowshop scheduling problem to minimize the number of tardy Jobs. International Journal of Advanced ManufacturingTechnology 2012 (to appear).
- [2] Aldowaisan T, Allahverdi A. A new heuristic for m-machine no-wait flowshop to minimize total completion time. OMEGA International Journal of ManagementSciences 2004; 32: 345-352.10.1016/j.omega.2004.01.004
- [3] Aldowaisan T, Allahverdi A. New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research 2003; 30: 1219-1231.10.1016/S0305-0548(02)00068-0
- [4] Allahverdi A, Aldowaisan T. No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research 2004; 152: 132-147.10.1016/S0377-2217(02)00646-X
- [5] Allahverdi A, Aldowaisan T. No-wait flowshops with bicriteria of makespan and total completion time. Journal of the Operational Research Society 2002; 53: 1004-1015.10.1057/palgrave.jors.2601403
- [6] Allahverdi, A., Gupta, J.N.D., and Aldowaisan, T. A review of scheduling research involving setup considerations. OMEGA International Journal of ManagementSciences 1999; 27: 219-239.10.1016/S0305-0483(98)00042-5
- [7] Allahverdi, A., Ng, C.T., Cheng, T.C.E., and Kovalyov, M.Y. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 2008; 187: 985-1032.10.1016/j.ejor.2006.06.060
- [8] Chang JL, Gong DW, Ma XP. A heuristic genetic algorithm for no-wait flowshop scheduling problem. Journal of China University of Mining and Technology 2007; 17: 582-586.10.1016/S1006-1266(07)60150-3
- [9] Chen CL, Neppalli RV, Aljaber N. Genetic Algorithms Applied to the Continuous Flow Shop Problem. Computers & Industrial Engineering 1996; 30: 919-929.10.1016/0360-8352(96)00042-3
- [10] Framinan JM, Nagano MS. Evaluating the performance for makespan minimization in no-wait flowshop sequencing. Journal of Materials Processing Technology 2008; 197: 1-9.10.1016/j.jmatprotec.2007.07.039
- [11] Framinan, J.M., Leisten, R. Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm. International Journal ofProduction Research 2008; 46: 6479-6498.10.1080/00207540701418960
- [12] Hall NG, Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 1996; 44: 510-525.10.1287/opre.44.3.510
- [13] Lenstra JK, Rinnooy Kan, AHG., Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1977; 1: 343-362.10.1016/S0167-5060(08)70743-X
- [14] Nawaz M, Enscore E, Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA International Journal of Management Science 1983; 11: 91-95.10.1016/0305-0483(83)90088-9
- [15] Pan QK, Tasgetiren MF, Liang YC. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research 2008; 35: 2807-2839.10.1016/j.cor.2006.12.030
- [16] Pinedo M (1995) Scheduling; theory, algorithms, and systems. Prentice Hall, Englewood Cliffs, New Jersey.
- [17] Vallada, E., Ruiz, R. Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. OMEGA International Journal of ManagementScience 2010; 38: 57-67.10.1016/j.omega.2009.04.002
- [18] Vallada, E., Ruiz, R., Minella, G. Minimizing total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers and Operations Research 2008; 35: 1350-1373.10.1016/j.cor.2006.08.016
- [19] Warburton RDH. EOQ extensions exploiting the Lambert W function. EuropeanJournal of Industrial Engineering 2009; 3: 45-69.10.1504/EJIE.2009.021584