The three-machine proportionate flow shop problem with unequal machine speeds

Operations Research Letters

Volumn 31, Issue 3, 2003, Pages 225-231

  Hou, Sixiang ^a   Hoogeveen, Han ^b  

^a Chinese Academy of Sciences   (China)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Dynamic programming; Machine speeds; Makespan; Ordered processing times; Proportionate flow shop; script N sign hardness; V shaped

Indexed keywords

MACHINERY; PROBLEM SOLVING; SCHEDULING; SHOPPING CENTERS;

MACHINE SPEEDS;

DYNAMIC PROGRAMMING;

EID: 0037402799     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00232-8     Document Type: Article

References (9)

1. Conway R.W., Maxwell W.L., Miller L.W. Theory of Scheduling. 1967;Addison-Wesley, Reading, MA.
2. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
3. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling. a survey Ann. Discrete Math. 5:1979;287-326.
4. Ow P.S. Focused scheduling in proportionate flow shops. Management Sci. 31:1985;852-869.
5. Pinedo M.L. A note on stochastic shop models in which jobs have the same processing requirements on each machine. Management Sci. 31:1985;840-845.
6. Pinedo M.L. Scheduling: Theory, Algorithms and Systems. 1995;Prentice-Hall, Englewood Cliffs, NJ.
7. Shakhlevich N., Hoogeveen J.A., Pinedo M.L. Minimizing total weighted completion time in a proportionate flow shop. J. Scheduling. 1:1998;157-168.
8. Smith M.L., Panwalkar S.S., Dudek R.A. Flow shop sequencing with ordered processing time matrices. Management Sci. 21:1975;544-549.
9. Smith M.L., Panwalkar S.S., Dudek R.A. Flow shop sequencing problem with ordered processing time matrices. a general case Naval Res. Logist. Quart. 23:1976;481-486.