A note on makespan minimization in two-stage flexible flow shops with uniform machines

European Journal of Operational Research

Volumn 175, Issue 2, 2006, Pages 1321-1327

  Kyparisis, George J ^a   Koulamas, Christos ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Approximation heuristic; Flexible flow shop; Flow shop scheduling; Worst case analysis

Indexed keywords

APPROXIMATION THEORY; HEURISTIC METHODS; MACHINABILITY; OPERATIONS RESEARCH; SPEED CONTROL;

APPROXIMATION/HEURISTIC; FLEXIBLE FLOW SHOP; FLOW SHOP SCHEDULING; WORST-CASE ANALYSIS;

PROBLEM SOLVING;

EID: 33748432308     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.06.017     Document Type: Article

References (6)

1. Chen B. Scheduling multiprocessor flow shops. In: Du D.-Z., and Sun J. (Eds). New Advances in Optimization and Approximation (1994), Kluwer 1-8
2. Cho Y., and Sahni S. Bounds for list schedules on uniform processors. SIAM Journal on Computing 9 (1980) 91-103
3. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
4. Lee C.-Y., and Vairaktarakis G.L. Minimizing makespan in hybrid flowshops. Operations Research Letters 16 (1994) 149-158
5. Soewandi H., and Elmaghraby S. Sequencing on two-stage hybrid flowshops with uniform machines to minimize makespan. IIE Transaction 35 (2003) 467-477
6. Sriskandarajah C., and Sethi S.P. Scheduling algorithms for flexible flowshops: Worst and average case performance. European Journal of Operational Research 43 (1989) 143-160