Employee scheduling and makespan minimization in a flow shop with multi-processor work stations: A case study

Omega

Volumn 32, Issue 2, 2004, Pages 121-129

  Huq, Faizul ^a   Cutright, Kenneth ^a   Martin, Clarence ^a  

^a OHIO UNIVERSITY   (United States)

Author keywords

Employee scheduling; Flow shop; Lot streaming; Makespan; Mixed integer linear programming

Indexed keywords

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

References (21)

1. Daniels R.L. Mazzola J.B. Flow shop scheduling with resource flexibility Operations Research 42 3 1994 504-522
2. Baker K.R. Introduction to sequencing and scheduling 1974 Wiley New York
3. Baker K.R. A comparative survey of flow shop algorithms Operations Research 23 1975 62-73
4. Goyal S.K. Note on manufacturing cycle time determination for a multi-stage economic production quantity model Management Science 23 1976 332-333
5. Lageweg B.J. Lenstra J.K. Rinnooy Kan A.H.G. A general bounding scheme for the permutation flow shop problem Operations Research 26 1978 53-67
6. Askin R.G. Standridge C.R. Modeling and analysis of manufacturing systems 1993 Wiley New York
7. Nawaz M. Enscore E.E. Ham I. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem Omega 11 1983 91-95
8. Leisten R. Flow shop sequencing problems with limited buffer storage International Journal of Production Research 28 1990 2085-2100
9. Suliman S.M.A. A two-phase heuristic approach to the permutation flow shop scheduling problem International Journal of Production Economics 64 2000 143-152
10. Reddi S.S. Ramamoorthy C.V. On the flow shop sequencing problem with no-wait in process Operational Research Quarterly 23 1972 323-330
11. Dudek R.A. Panwalkar S.S. Smith M.L. The lessons of flow shop scheduling research Operations Research 40 1 1992 7-13
12. Grabowski J. Skubalska E. Smutnicki C. On flow shop scheduling with release and due dates to minimize maximum lateness Journal of the Operational Research Society 34 1983 615-620
13. Kim Y.-D. Heuristics for flow shop scheduling problems minimizing mean tardiness Journal of the Operational Research Society 44 1993 19-28
14. Moursli O. Pochet Y. Heuristics for scheduling a multiprocessor flow shop. Advances in Industrial Engineering Applications and Practice I (AICIE 96), Houston, 1996. p. 456-63.
15. Hall N.G. Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process Operations Research 44 1996 510-525
16. Van de Velde S. Linear programming bounds for minimizing total completion time in a two-machine flow shop. Scheduling in Computer and Manufacturing Systems, Seminar Reports, Dagstuhl, June 1997.
17. Guinet A. What is the most generic model: job-shop or flow-shop? Scheduling in Computer and Manufacturing Systems, Seminar Reports, Dagstuhl, June 1997.
18. Armentano V.A. Ronconi K.D.P. Tabu search for total tardiness minimization in flow shop scheduling problems Computers and Operations Research 26 1999 219-235
19. Pesch E. Batching to minimize job flow times on one machine. Scheduling in Computer and Manufacturing Systems, Seminar Reports, Dagstuhl, June 1997.
20. Bagchi TP, Subodha Kumar, Sriskandarajah C. Lot streaming heuristics for the m-machine no-wait flow shop. Department of Mechanical and Industrial Engineering, University of Toronto, 1996.
21. Huq F, Mohamed MZ. An efficient model for multi-family lot-sizing and scheduling: application to a real life problem, Working paper.