Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times

Computers and Operations Research

Volumn 34, Issue 10, 2007, Pages 3055-3068

  Swaminathan, Rajesh ^a   Pfund, Michele E ^b   Fowler, John W ^b   Mason, Scott J ^a   Keha, Ahmet ^b  

^a 3202 Bell Engineering Center   (United States)

^b Arizona State University   (United States)

Author keywords

Flowshop; Heuristic; Manufacturing; Permutation

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; SCHEDULING;

FLOWSHOP; SHIFT-BASED SCHEDULING; TOTAL WEIGHTED TARDINESS (TWT);

OPERATIONS RESEARCH;

EID: 33847619266     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.11.014     Document Type: Article

References (33)

1. Portougal V., and Robb D.J. Production scheduling theory: just where is it applicable?. Interfaces 30 6 (2000) 64-76
2. Pinedo M. Scheduling theory, algorithms and systems. 2nd ed. (2002), Prentice-Hall, Englewood Cliffs, NJ
3. Perez I.C., Imelda C., Fowler J.W., and Carlyle W.M. Minimizing total weighted tardiness on a single batch process machine with incompatible job families. Computers and Operations Research 32 (2005) 327-341
4. Kim Y. Minimizing total tardiness in permutation flowshops. European Journal of Operational Research 85 3 (1995) 541-555
5. Johnson S.M. Optimal two and three-stage production schedules with setup times included. Naval Research Quarterly 1 (1954) 61-68
6. Wan Y. Which is better, off-line or real-time scheduling?. International Journal of Production Research 33 7 (1995) 2053-2059
7. Dudek R.A., Panwalkar S.S., and Smith M.L. The lessons of flowshop scheduling research. Operations Research 40 1 (1992) 7-13
8. Ruiz R., and Moroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operations Research 165 2 (2005) 479-494
9. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
10. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. The International Journal of Management Science 11 1 (1983) 91-95
11. Gelders L.F., and Sambandam N. Four simple heuristics for scheduling a flowshop. International Journal of Production Research 16 (1978) 221-231
12. Kim Y.D. Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of Operational Research Society 44 (1993) 19-28
13. Armentano V.A., and Ronconi D.P. Tabu search for total tardiness maximization in flowshop scheduling problems. Computers and Operations Research 26 (1999) 219-235
14. Parthasarathy S., and Rajendran C. Scheduling to minimize mean tardiness and weighted mean tardiness in a flowshop and flowline based manufacturing cell. Computers and Industrial Engineering 34 2 (1998) 531-546
15. Hasija S., and Rajendran C. Scheduling flowshops to minimize total tardiness of jobs. International Journal of Production Research 42 11 (2004) 2289-2301
16. Sonmez A.I., and Baykasoglu A. A new dynamic programming formulation of (n × m) flowshop sequencing problems with due dates. International Journal of Production Research 36 8 (1998) 2269-2283
17. Chang Y.S., and Sullivan R.S. QSOM: quantitative systems for operations management. Version 2 (1991), Prentice-Hall, Englewood Cliffs, NJ
18. Portougal V., and Scott J.L. The asymptotic convergence of some flowshop scheduling heuristics. Asia-Pacific Journal of Operational Research 18 (2001) 243-256
19. Portougal V. Asymptotic behavior of some scheduling algorithms. Asia-Pacific Journal of Operational Research 10 (1993) 79-92
20. Vepsalainen A.P.J., and Morton T.E. Priority rules for job shops with weighted tardiness costs. Management Science 33 8 (1987) 1035-1047
21. Gadkari A. Scheduling to reduce total weighted tardiness on parallel machines with ready times. Master's Thesis, Arizona State University, 2003.
22. Reeves C.R. Genetic algorithm for flowshop sequencing. Computers and Operations Research 22 1 (1995) 5-13
23. Iyer S.K., and Saxena B. Improved genetic algorithm for the permutation flowshop scheduling problem. Computers and Operations Research 31 (2004) 593-606
24. Man K.F., Tang K.S., and Kwong S. Genetic algorithms: concepts and designs (1999), Springer, London
25. Davis L. Handbook of genetic algorithms (1992), Van Nostrand Reinhold, London
26. Pritsker A.A. Introduction to simulation and SLAM II. 3rd ed. (1986), Wiley, New York, NY
27. Beasley JE. OR-Library, Collection of test datasets 1990. http://mscmga.ms.ic.ac.uk/jeb/pub/flowshop1.txt [accessed 31 March, 2004].
28. Parthasarathy S., and Rajendran C. Experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs. International Journal of Production Economics 49 3 (1997) 255-263
29. Swaminathan R. Minimizing total weighted tardiness in dynamic flowshops with variable processing times. Master's Thesis, Arizona State University, 2004.
30. Andres C., Albarracin J., Tormo G., Vicens E., and Garcia-Sabater J.P. Group technology in a hybrid flowshop environment: a case study. European Journal of Operational Research 167 (2005) 272-281
31. Franca P.M., Gupta J.N.D., Mendes A.S., Moscato P., and Veltink K.J. Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers and Industrial Engineering 48 (2005) 491-506
32. Lee Y.H., Bhaskaran K., and Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29 (1997) 45-52
33. Pugazhendhi S., Thiagarajan S., Rajendran C., and Anantharaman N. Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems. Computers and Industrial Engineering 44 1 (2002) 133-157