Performance measures and schedules in periodic job shops

Operations Research

Volumn 45, Issue 1, 1997, Pages 72-91

  Lee, Tae Eog ^a   Posner, Marc E ^b  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPERATIONS RESEARCH; OPTIMIZATION; PROCESS CONTROL; SCHEDULING;

MINIMAL PART SET (MPS); PERIODIC JOB SHOPS;

PRODUCTION CONTROL;

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

References (17)

1. AFENTAKIS, P. 1986. Maximum Throughput in Flexible Manufacturing Systems. Proceedings of the Second ORSA/TIMS Conference on Flexible Manufacturing Systems: Operations Research Models and Applications. K. E. Stecke and R. Suri (eds.). Elsevier Science Publishers B. V., Amsterdam, 509-520.
2. AHUJA, R. K., T. L. MAGNANTI, AND J. B. ORLIN. 1993. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs, NJ.
3. CARLIER, J. AND P. CHRETIENNE. 1990. On the Dominance of K-periodic Schedules in Cyclic Scheduling. Second International Workshop on Project Management and Scheduling, Compiègne, France.
4. CHRETIENNE, P. 1983. Les Réseaux de Petri Temporisés, thèse d'état, P. and M. Curie University, Paris.
5. CLAVER, J. F. AND P. JACKSON. 1987. Lot Sizing in Cyclic Scheduling. Technical Report No. 736. School of Operations Research and Industrial Engineering, Cornell University, Ithaca, N.Y.
6. COHEN, G., D. DUBOIS, J. P. QUADRAT, AND M. VIOT. 1985. A Linear-System-Theoretic View of Discrete-Event Processes and its Use for Performance Evaluation in Manufacturing. IEEE Trans. Automatic Control 30, 210-220.
7. DANTZIG, G. B., W. O. BLATTNER, AND M. R. RAO. 1966. Finding a Cycle in a Graph with Minimum Cost to Time Ratio with Application to a Ship Routing Problem. In Theory of Graphs, P. Rosenstiehl (ed.). Gordon and Breach, New York, 77-83.
8. KARP, R. M. AND J. B. ORLIN. 1981. Parametric Shortest Path Algorithms with an Application to Cyclic Staffing. Discrete App. Math. 3, 37-45.
9. LAWLER, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
10. LEE, T. E. 1991. Periodic Job Shop Scheduling. Ph.D. Dissertation, The Ohio State University, Columbus, Ohio.
11. MATSUO, H. 1988. Cyclic Sequencing Problems in the Two-Machine Permutation Flow Shop: Complexity, Worst Case and Average Case Analysis. Manuscript. Graduate School of Business, University of Texas, Austin, Texas.
12. McCORMICK, S. T., M. L. PINEDO, S. SHENKER, AND B. WOLF. 1989. Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Opns. Res. 37, 925-935.
13. MUNIER, A. 1990. The Complexity of a Cyclic Scheduling Problem With Identical Machines. Second International Workshop on Project Management and Scheduling, Compiègne, France.
14. NEMHAUSER, G. L. AND L. A. WOLSEY. 1988. Integer and Combinatorial Optimization. John Wiley and Sons, NY.
15. ORLIN, J. B. 1983. Maximum Throughput Dynamic Network Flows. Math. Prog. 27, 214-231.
16. ORLIN, J. B. 1984a. Minimum Convex Cost Dynamic Network Flows. Math. O. R. 9, 190-207.
17. ORLIN, J. B. 1984b. Some Problems on Dynamic/Periodic Graphs. In Progress in Combinatorial Optimization, W. R. Pulleyblank (ed.), 273-293.