Makespan and workstation utilization minimization in a flowshop with operations flexibility

Omega

Volumn 39, Issue 3, 2011, Pages 273-282

  Ruiz Torres, Alex J ^a,b   Ho, Johnny C ^c   Ablanedo Rosas, José H ^b  

^a UNIVERSITY OF PUERTO RICO RIO PIEDRAS   (Puerto Rico)

^b UNIVERSITY OF TEXAS AT EL PASO   (United States)

^c Columbus State University   (United States)

Author keywords

Flowshop; Makespan; Operations flexibility; Scheduling; Sum of machine completion times; Workstation utilization

Indexed keywords

FLOW-SHOPS; MACHINE COMPLETION TIME; MAKESPAN; MINIMISATION; OPERATIONS FLEXIBILITY; PRODUCTION ENVIRONMENTS; SCHEDULING; SUM OF MACHINE COMPLETION TIME; TWO PHASE; WORKSTATION UTILIZATION;

SIMULATED ANNEALING;

EID: 77957161753     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2010.07.004     Document Type: Article

References (27)

1. Burdett R.L., Kozan E. Sequencing and scheduling in flowshops with task redistribution. The Journal of the Operational Research Society 2001, 52:1379-1389.
2. Coffman E.G. Computer and job shop scheduling theory 1976, Wiley, New York.
3. Coffman E.G., Garey M.R., Johnson D.S. An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing 1978, 7:1-17.
4. Dong X., Huang H., Chen P. An improved NEH-based heuristic for the permutation flowshop problem. Computers and Operations Research 2008, 35:3962-3968.
5. Fondrevelle J., Oulamara A., Portmann M.-C. Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times. International Journal Production Economics 2008, 112:168-176.
6. Framinan J.M., Leisten R., Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research 2003, 41:121-148.
7. Garey M., Johnson D., Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1976, 1:117-129.
8. Gupta JND, Stafford EF Flowshop scheduling research after five decades. European Journal of Operational Research 2006, 169:699-711.
9. Ho J.C., Chang Y.L. A new heuristic for the n-job, m-machine flowshop problem. European Journal of Operational Research 1991, 52:194-202.
10. Ho J.C., Gupta JND Flowshop scheduling with dominant machines. Computers and Operations Research 1995, 22:237-246.
11. Johnson S.M. Optimal two- and three-stage production schedules with set up times included. Naval Research Logistics Quarterly 1954, 1:61-68.
12. Kalczynski P.J., Kamburowski J. On the NEH heuristic for minimizing the makespan in permutation flow shops. OMEGA, The International Journal of Management Science 2007, 35:53-60.
13. Kalczynski P.J., Kamburowski J. An improved NEH heuristic to minimize makespan in permutation flow shops. Computers and Operations Research 2008, 35:3001-3008.
14. Laha D., Sarin S.C. A heuristic to minimize total flow time in permutation flow shop. OMEGA, The International Journal of Management Science 2009, 37:734-739.
15. Li X., Wang Q., Wu C. Efficient composite heuristics for total flowtime minimization in permutation flow shops. OMEGA, The International Journal of Management Science 2009, 37:155-164.
16. Lodree E., Jang W., Klein C.M. A new rule for minimizing the number of tardy jobs in dynamic flow shops. European Journal of Operational Research 2004, 159:258-263.
17. Manjeshwar P.K., Damodaran P., Srihari K. Minimizing makespan in a flowshop with two batch-processing machines using simulated annealing. Robotics and Computer-Integrated Manufacturing 2009, 25:667-679.
18. Naderi B., Ruiz R. The distributed permutation flowshop scheduling problem. Computers and Operations Research 2010, 37:754-768.
19. Nawaz M., Enscore E.E., Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, The International Journal of Management Science 1983, 11:91-95.
20. Rad S.F., Ruiz R., Boroojerdian N. New high performing heuristics for minimizing makespan in permutation flowshops. OMEGA, The International Journal of Management Science 2009, 37:331-345.
21. Ruiz R., Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 2005, 165:479-494.
22. Ruiz-Torres A.J., Ablanedo-Rosas J.H., Ho J.C. Minimizing the number of tardy jobs in the flowshop problem with operation and resourse flexibility. Computers and Operations Research 2010, 37:282-291.
23. Sridhar J., Rajendran C. Scheduling in flowshop and cellular manufacturing systems with multiple objectives-a genetic algorithmic approach. Production Planning and Control 1996, 7:374-382.
24. Wang J., Shan F., Jiang B., Wang L.-Y. Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time. Applied Mathematics and Computation 2006, 182:947-954.
25. Xiang S., Tang G., Cheng TCE Solvable cases of permutation flowshop scheduling with dominating machines. International Journal of Production Economics 2000, 66:53-57.
26. Vallada E., Ruiz R. Cooperative metaheuristics for the permutation flowshop scheduling problem. European Journal of Operational Research 2009, 193:365-376.
27. Vallada E, Ruiz R. Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. OMEGA, The International Journal of Management Science 2010, 38:57-67.