Minimizing makespan in a class of reentrant shops

Operations Research

Volumn 45, Issue 5, 1997, Pages 702-712

  Wang, M Y ^a   Sethi, S P ^b   Van De Velde, S L ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

^c ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

BRANCH AND BOUND ALGORITHM; CHAIN REENTRANT SHOP; PSEUDO POLYNOMIAL ALGORITHM;

PRODUCTION CONTROL;

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

References (16)

1. BAKER, K. R. 1995. Elements of Sequencing and Scheduling, Revised Edition. Hanover, NH.
2. BAI, S. AND S. B. GERSHWIN. 1990. Scheduling Manufacturing Systems with Work-in-process Inventory. Proceedings of the 29th IEEE Conference in Decision and Control. 2, 557-564.
3. BRAMCON, M. 1993. Instability of FIFO Queuing Networks. Technical Report, Mathematics Department, University of Wisconsin, Madison, WI.
4. BURNS, F. AND J. ROOKER. 1976. Johnson's Three-machine Flow Shop Conjecture. Opns. Res. 24, 578-580.
5. BURNS, F. AND J. ROOKER. 1978. Three Stage Flow Shops with Regressive Second Stage. Opns. Res. 26, 207-208.
6. ELLIOT, D. J. 1989. Integrated Circuit Fabrication Technology. McGraw-Hill Book Company, New York.
7. GAREY, M. R. AND D. S. JOHNSON. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
8. GAREY, M. R., D. S. JOHNSON, AND R. SETHI. 1976. The Complexity of Flowshop and Jobshop Scheduling. Math. O.R. 1, 117-129.
9. GRAHAM, R. L., E. L. LAWLER, J. K. LENSTRA, AND A. H. G. RINNOOY KAN. 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Ann. Discrete Math. 5, 287-326.
10. GUPTA, J. N. D. 1993. Private correspondence.
11. JOHNSON, S. M. 1954. Optimal Two- and Three-stage Production Schedules with Setup Times Included. Naval Res. Logist, l, 61-68.
12. KUBIAK, W., S. X. Lou, AND Y. WANG. 1996. Mean Flow Time Minimization in Reentrant Jobshops with Hub. Opns. Res. 44, 764-776.
13. KUMAR, P. R. 1993. Reentrant Lines. To appear in a special issue of Queuing Systems: Theory and Applications.
14. KUMAR, P. R. AND T. I. SEIDMAN. 1990. Dynamic Instabilities and Stabilization Methods in Distributed Real-time Scheduling of Manufacturing Systems. IEEE Trans. Automatic Control AC-35, 289-298.
15. LEV, V. AND I. ADIRI. 1984. V-shop Scheduling. European J. Opnl. Res. 18, 51-56.
16. Lou, S. X. C., H. YAN, S. SETHI, A. GARDEL, AND P. DEOSTHALI. 1991. Using Simulation to Test the Robustness of Various Existing Production Control Policies. Proceedings of Winter Simulation Conference, 261-269.