A survey of machine scheduling problems with blocking and no-wait in process

Operations Research

Volumn 44, Issue 3, 1996, Pages 510-525

  Hall, Nicholas G ^a   Sriskandarajah, Chelliah ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FACTORY AUTOMATION; HEURISTIC METHODS; OPERATIONS RESEARCH; PROCESS CONTROL; SCHEDULING; STOCHASTIC CONTROL SYSTEMS;

BLOCKING PRODUCTION ENVIRONMENT; MACHINE SCHEDULING PROBLEMS;

PRODUCTION CONTROL;

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

References (16)

1. AARTS, E. H. L., AND P. J. M. VAN LAARHOVEN. 1985. Statistical Cooling: A General Approach to Combinatorial Optimization Problems. Phillips J. Res. 40, 193.
2. ADAMS, J., E. BALAS, AND D. ZAWACK. 1988. The Shifting Bottleneck Procedure for Job Shop Scheduling. Mgmt. Sei. 34, 391-401.
3. ADIRI, I., AND N. AMIT. 1984. Openshop and Flowshop Scheduling to Minimize Sum of Completion Times. Computers and Opns. Res. 11, 275-284.
4. ADIRI, I., AND D. POHORYLES. 1982. FIowshop/No-idle or No-wait Scheduling to Minimize the Sum of Completion Times. Naval Res. Logistics Quarterly. 29, 3, 495-504.
5. AGNETIS, A. 1989. No-wait Flow Shop Scheduling with Large Lot Size. Research Report 16.89, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Rome.
6. ARORA, R. K., AND S. P. RANA. 1980. Scheduling in a Semi-ordered Flowshop without Intermediate Queues. AIIE Trans. 12, 263-272.
7. AXSÄTER, S. 1982. On Scheduling in a Semi-ordered Flowshop without Intermediate Queues. IIE Trans. 14, 128-130.
8. BAKER, K. R. 1974. Introduction to Sequencing and Scheduling. Addison-Wesley, Reading, MA.
9. BLAZEWICZ, J., W. KUBIAK, AND J. SZWARCFITER. 1988. Scheduling Unit-time Tasks on Flow-shops under Resource Constraints. Annals of Opns. Res. 16, 255-266.
10. BLAZEWICZ, J., J. K. LENSTRA, AND A. H. G. RINNOOY KAN. 1983. Scheduling Subject to Resource Constraints: Classification and Complexity. Discrete Applied Math. 5, 11-24.
11. SZWARC, W. 1981. A Note on the Flow-shop Problem without Interruptions in Job Processing. Naval Res. Logistics Quarterly. 28, 4, 665-669.
12. ULLMAN, J. D. 1975. W-Complete Scheduling Problems. J. Computer and System Sci. 10, 384-393.
13. VAN DEMAN, J. M., AND K. R. BAKER. 1974. Minimizing Mean Flow Time in the Flowshop with No Intermediate Queues. AIIE Trans. 6, 28-34.
14. VAN DER VEEN, J. A. A., AND R. VAN DAL. 1991. Solvable Cases of the No-wait Flow-shop Scheduling Problem. J. Opnl. Res. Soc. 42, 11, 971-980.
15. WAGNEUR, E., AND C. SRISKANDARAJAH. 1990. Control and Scheduling of m-processor Flowshop with State Dependent Processing Times. Cahier du GERAD G-90-28, École des Hautes Études Commerciales, Montréal, Canada.
16. WAGNEUR, E., AND C. SRISKANDARAJAH. 1993a. The Two-machine Permutation Flow Shop with State Dependent Processing Times. Naval Res. Logistics. 40, 697-717.