Flowshops with processing flexibility across production stages

IIE Transactions (Institute of Industrial Engineers)

Volumn 30, Issue 8, 1998, Pages 735-746

  Kouvelis, Panagiotis ^a   Vairaktarakis, George ^b  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; POLYNOMIALS; PROCESS CONTROL; SCHEDULING;

FLEXIBLE FLOWSHOP (FFS) ENVIRONMENTS; HYBRID FLOWSHOP (HFS) ENVIRONMENTS; PARALLEL MACHINES;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0032132158     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179808966519     Document Type: Article

References (17)

1. Qaker, K.R., (1993) Elements of Sequencing and Scheduling, Dartmouth, Hanover, NH.
2. Pinedo, M., (1995) Scheduling Theory, Algorithms and Systems, Prentice Hall, Englewood Cliffs, NJ.
3. Herrmann, J.W., and Lee, C.-Y., (1992) Three-machine look-ahead scheduling problems. Research Report 92–23. Department of Industrial and Systems Engineering. University of Florida, Gain-sville, FL.
4. Lee, C.-Y., Cheng, T.C E., Lin B.M.T., (1993) Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science, 39 (5), 616–625.
5. Sriskandarajah, C., and Sethi, SP., (1989) Scheduling algorithms for flexible flowshops worst and average case performance. European Journal of Operational Research, 43, 143–160.
6. Wittrock, R.J., (1988) An adaptable scheduling algorithm for flexible flow lines. Operations Research, 36, 445–453.
7. Lee, C-Y., and Vairaktarakis, G., (1994) Minimizing makespan in hybrid flowshops. Operations Research Letters, 16, 149–158.
8. Hoogeveen, J.A., Lenstra, J.K., and Veltman, B., (1996) Preemptive scheduling in a two-stage multiprocessor flowshop is NP-hard. European Journal of Operational Research, 89, 172–175.
9. Guinet, A., and Solomon, M.M., (1996) Scheduling hybrid flow-shops to minimize maximum tardiness or maximum completion time. International Journal of Production Research, 34, 1643–1654.
10. Gupta, J.N.D., Hariri, A.M.A., and Potts, C.N., (1997) Scheduling a two-stage hybrid flowshop with parallel machines at the first stage. Annals of Operations Research, 69, 171–191.
11. Solomon, M.M., Kedia P.K.Dussauchoy A., (1996) A computational study of heuristics for two-stage flexible flowshops. International Journal of Production Research, 34, 1399–1416.
12. Garey, M.R., Johnson D.S., (1979) Computers and Intractability, W.H. Freeman, San Francisco, CA.
13. Johnson, S.M., (1954) Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61–68.
14. Jackson, J.R., (1956) An extension of Johnson's results on job lot scheduling. Naval Research Logistics Quarterly, 3 201–203.
15. Blazewicz, J., Ecker, K., Schmidt, G., and Weglartz, J., (1993) Scheduling in Computer and Manufacturing Systems, Springer Verlag, Berlin.
16. Cheng, T.C.E., Sin CCS., (1990) A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47, 271–292.
17. Graham, R.L., (1969) Bounds on multiprocessing timing anomalies. SJAM Journal of Applied Mathematics, 17, 416–429.