A probabilistic analysis of two-machine flowshops

Operations Research

Volumn 44, Issue 6, 1996, Pages 899-908

  Ramudhin, Amar ^a   Bartholdi III, John J ^b   Calvin, James M ^b   Vande Vate, John H ^b   Weiss, Gideon ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; PROCESS CONTROL; RANDOM PROCESSES; SCHEDULING;

TWO MACHINE FLOWSHOPS;

OPERATIONS RESEARCH;

EID: 0030281871     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.6.899     Document Type: Article

References (7)

1. BARANY, I. 1981. A Vector-sum Theorem and Its Application to Improving Flow Shop Guarantees. Math. O. R. 6(3), 445-452.
2. DANNENBRING, D. G. 1977. The Evaluation of Flowshop Sequencing Heuristics. Mgmt. Sci. 23(11), 1174-1182.
3. DUDEK, R. A., S. S. PANWALKAR, AND M. L. SMITH. 1992. The Lessons of Flowshop Scheduling Research. Opns. Res. 40(1), 7-13.
4. GAREY, M. AND D. JOHNSON. 1979. Computers and Intractability. W. H. Freeman and Company, San Francisco, CA.
5. GLYNN, P. W., AND W. WHITT. 1991. Departures from Many Queues in Series. Ann. Appl. Prob. 1(4), 546-572.
6. JOHNSON, S. M. 1954. Optimal Two and Three-stage Production Schedules with Set-up Times Included. Naval Res. Logist. 1(1), 61-68.
7. PAPADIMITRIOU, C. H. AND P. C. KANELLAKIS. 1980. Flowshop Scheduling with Limited Temporary Storage. J. Assoc. Comput. Mach. 27, 533-549.