Minimizing total tardiness in no-wait flowshops

Tariq Aldowaisan; Ali Allahverdi

doi:10.2478/v10209-011-0009-6

.blurhash-client-img { display: none !important; }

Minimizing total tardiness in no-wait flowshops

Foundations of Computing and Decision Sciences

Volume 37 (2012): Issue 3 (September 2012)

By: Tariq Aldowaisan and Ali Allahverdi

Open Access

|Oct 2012

[1] Aldowaisan, T., and Allahverdi, A. No-wait flowshop scheduling problem to minimize the number of tardy Jobs.2012 (to appear).
Search in Google Scholar
[2] Aldowaisan T, Allahverdi A. A new heuristic for m-machine no-wait flowshop to minimize total completion time.2004; 32: 345-352.
Open DOI Search in Google Scholar
[3] Aldowaisan T, Allahverdi A. New heuristics for no-wait flowshops to minimize makespan.2003; 30: 1219-1231.
Open DOI Search in Google Scholar
[4] Allahverdi A, Aldowaisan T. No-wait flowshops with bicriteria of makespan and maximum lateness.2004; 152: 132-147.
Open DOI Search in Google Scholar
[5] Allahverdi A, Aldowaisan T. No-wait flowshops with bicriteria of makespan and total completion time.2002; 53: 1004-1015.
Open DOI Search in Google Scholar
[6] Allahverdi, A., Gupta, J.N.D., and Aldowaisan, T. A review of scheduling research involving setup considerations.1999; 27: 219-239.
Open DOI Search in Google Scholar
[7] Allahverdi, A., Ng, C.T., Cheng, T.C.E., and Kovalyov, M.Y. A survey of scheduling problems with setup times or costs.h 2008; 187: 985-1032.
Open DOI Search in Google Scholar
[8] Chang JL, Gong DW, Ma XP. A heuristic genetic algorithm for no-wait flowshop scheduling problem2007; 17: 582-586.
Open DOI Search in Google Scholar
[9] Chen CL, Neppalli RV, Aljaber N. Genetic Algorithms Applied to the Continuous Flow Shop Problem.1996; 30: 919-929.
Open DOI Search in Google Scholar
[10] Framinan JM, Nagano MS. Evaluating the performance for makespan minimization in no-wait flowshop sequencing. Journal2008; 197: 1-9.
Open DOI Search in Google Scholar
[11] Framinan, J.M., Leisten, R. Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm. International2008; 46: 6479-6498.
Open DOI Search in Google Scholar
[12] Hall NG, Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process.1996; 44: 510-525.
Open DOI Search in Google Scholar
[13] Lenstra JK, Rinnooy Kan, AHG., Brucker P. Complexity of machine scheduling problems.1977; 1: 343-362.
Open DOI Search in Google Scholar
[14] Nawaz M, Enscore E, Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem.1983; 11: 91-95.
Open DOI Search in Google Scholar
[15] Pan QK, Tasgetiren MF, Liang YC. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem.2008; 35: 2807-2839.
Open DOI Search in Google Scholar
[16] Pinedo M (1995). Prentice Hall, Englewood Cliffs, New Jersey.
Search in Google Scholar
[17] Vallada, E., Ruiz, R. Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem.2010; 38: 57-67.
Open DOI Search in Google Scholar
[18] Vallada, E., Ruiz, R., Minella, G. Minimizing total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics.2008; 35: 1350-1373.
Open DOI Search in Google Scholar
[19] Warburton RDH. EOQ extensions exploiting the Lambert W function.2009; 3: 45-69.
Open DOI Search in Google Scholar