On-line Algorithms for Hybrid Flow Shop Scheduling

Proceedings of the Joint Conference on Information Sciences

Volumn 3, Issue , 1998, Pages 134-137

  Havill, Jessen T ^a   Mao, Weizhen ^b  

^a DENISON UNIVERSITY   (United States)

^b The College of William and Mary   (United States)

Author keywords

Hybrid flow shop; Job scheduling; On line algorithms

Indexed keywords

HYBRID FLOW SHOPS; JOB SCHEDULING; ON-LINE ALGORITHMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; ONLINE SYSTEMS; PARALLEL PROCESSING SYSTEMS; PERFORMANCE; PROBLEM SOLVING; THEOREM PROVING;

SCHEDULING;

EID: 1642315543     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M. R. Garey, D. S. Johnson, and R. Sethi, The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117-129 (1976).
2. R. L. Graham, Bounds for multiprocessing timing anomalies, SIAM J. Appl. Math. 17, 416-429 (1969).
3. J. N. D. Gupta, Two-stage hybrid flowshop scheduling problem, Journal of the Operational Research Society, 39, 359-364 (1988).
4. J. N. D. Gupta and E. A Tunc, Schedules for a two-stage hybrid flowshop with parallel machines at the second stage, International Journal of Production Research, 29, 1489-1502 (1991)
5. S. M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistic Quarterly, 1, 61-68 (1954).
6. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory, S. C. Graves, A. H. G. Rinnooy Kan and P. Zipkin, ed., NorthHolland (1990).