A note on makespan minimization in proportionate flow shops

Authors:
Byung-Cheon Choi;Joseph Y. -T. Leung;Michael L. Pinedo
Affiliations:
Department of Business, Chungnam National University, 79 Daehakro, Yuseong-gu Daejeon 305-764, Republic of Korea;Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA;Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012-1126, USA
Venue:
Information Processing Letters
Year:
2010

Citing 6
Cited 0

Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness

Computers and Operations Research
Minimizing Total Completion Time in a Two-Machine

Mathematics of Operations Research
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Time-Dependent Scheduling

Time-Dependent Scheduling
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
The three-machine proportionate flow shop problem with unequal machine speeds

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract