Evaluation and comparison of production schedules

Computers in Industry

Volumn 42, Issue 2, 2000, Pages 203-220

  Kempf, Karl ^a   Uzsoy, Reha ^b   Smith, Stephen ^a   Gary, Kevin ^c  

^a INTEL CORPORATION   (United States)

^b SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

^c Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORY AUTOMATION; SCHEDULING;

PRODUCTION SCHEDULE;

PRODUCTION ENGINEERING;

EID: 0033728696     PISSN: 01663615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-3615(99)00071-8     Document Type: Article

References (66)

1. Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job-shop scheduling. Management Science. 34:1988;391-401.
2. Bai X., Srivatsan N., Gershwin S.B. Hierarchical real-time scheduling of a semiconductor fabrication facility. Proceedings of the Ninth IEEE International Electronics Manufacturing Technology Symposium, Washington DC. 1990.
3. Bansal S.P. Single machine scheduling to minimize weighted sum of completion times with secondary criterion - a branch and bound approach. European Journal of Operational Research. 5:1980;177-181.
4. Barr R.S., Golden B.L., Kelly J.P., Resende M.G.C., Stewart W.R. Designing and reporting on computational experiments with Heuristic methods. Journal of Heuristics. 1:1995;9-32.
5. Bean J.C., Birge J.R., Mittenthal J., Noon C.E. Matchup scheduling with multiple resources, release dates and disruptions. Operations Research. 39:1991;470-483.
6. Bhaskaran K., Pinedo M. Dispatching. Salvendy G. Handbook of industrial engineering. 1991;Wiley, New York. Chap. 83.
7. Chand S., Schneeberger H. A note on the single-machine scheduling problem with minimum weighted completion time and minimum allowable tardiness. Naval Research Logistics Quarterly. 33:1986;551-557.
8. Chand S., Schneeberger H. Single machine scheduling to minimize weighted earliness subject to no tardy jobs. European Journal of Operational Research. 34:1988;221-230.
9. Chang Y.L., Sueyoshi T., Sullivan R.S. Ranking dispatching rules by data envelopment analysis in a job shop environment. IIE Transactions on Scheduling and Logistics. 28:1986;631-642.
10. Cheng T.C.E., Gupta M.C. Survey of scheduling research involving due date determination decisions. European Journal of Operational Research. 38:1989;156-166.
11. Church L.K., Uzsoy R. Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Journal of Computer-Integrated Manufacturing. 5:1992;153-163.
12. Conway R.W., Maxwell W.L., Miller L.W. Theory of scheduling. 1967;Addison-Wesley.
13. Daniels R.L., Kouvelis P. Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Science. 41:1995;363-376.
14. Dannenbring D.G. Procedures for estimating optimal solution values for large combinatorial problems. Management Science. 23:1977;1273-1283.
15. Dauzere-Peres S., Lasserre J.-B. An integrated approach in production planning and scheduling. Lecture notes in economics and mathematical systems. 1994;Springer-Verlag, Berlin.
16. Dileepan P., Sen T. Bicriterion static scheduling research for a single machine. OMEGA. 16:1988;53-59.
17. Duffie N.A., Piper R.S. Non-hierarchical control of a flexible manufacturing cell. Robotics and Computer-Integrated Manufacturing. 3:1987;175-179.
18. Elleby P., Fargher H.E., Addis T.R. A constraint-based scheduling system for VLSI wafer fabrication. Browne J. Knowledge-based production management systems. 1989;Elsevier.
19. Fisher J. Use of nonfinancial performance measures. Journal of Cost Management. 1992;31-38. Spring.
20. Fox M.S., Smith S.F. ISIS: a knowledge-based system for factory scheduling. Expert Systems. 1:1984;25-49.
21. Gary K., Kempf K., Smith S., Uzsoy R. Assessing the quality of production schedules. Scherer W., Brown D. Intelligent scheduling systems. 1995;129-154 Kluwer Academic Publishing.
22. Garey M.R., Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness. 1979;Freeman, San Francisco.
23. Golden B.L., Alt F.B. Interval estimation of a global optimum for large combinatorial problems. Naval Research Logistics Quarterly. 26:1979;69-77.
24. Goldratt E.M. The goal: a process of ongoing improvement. 1986;North River Press, Croton on Hudson.
25. Gong L., Matsuo H. A control policy for a manufacturing system with random yield and rework. The Graduate School of Business. University of Texas at Austin, 1990.
26. Hadavi K., Shahraray M.S., Voigt K. ReDS: a dynamic planning, scheduling and control system for manufacturing. Journal of Manufacturing Systems. 9:1989;332-344.
27. Harrison J.M., Holloway C.A., Patell J.M. Measuring delivery performance: a case study from the semiconductor industry. Kaplan R.S. Measures for manufacturing excellence. 1990;Harvard Business School Press.
28. Hayes R.H., Wheelwright S.C. Restoring our competitive edge: computing through manufacturing. 1984;Wiley, New York.
29. Hooker J. Needed: an empirical science of algorithms. Operations Research. 42:1994;201-212.
30. Hooker J. Testing Heuristics: we have it all wrong. Journal of Heuristics. 1:1995;33-42.
31. Jones C.H. An economic evaluation of job shop dispatching rules. Management Science. 20:1973;293-307.
32. Kempf K.G. Intelligently scheduling semiconductor wafer fabrication. Zweben M., Fox M. Knowledge-based scheduling. 1994;Morgan Kaufman.
33. Kempf K.G., Beaumariage T. The nature and origin of chaos in manufacturing systems. Proceedings of the IEEE/SEMI Advanced Semiconductor Manufacturing Conference. 1994;169-174.
34. Kempf K., Russell B., Sidhu S., Barrett S. Artificially intelligent schedulers in manufacturing practice. AI Magazine. 11(5):1991;46-56.
35. Kerr R.M., Ebsary R.V. Implementation of an expert system for production scheduling. European Journal of Operational Research. 33:1988;17-29.
36. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. Sequencing and scheduling: algorithms and complexity. Graves S.C., Rinnooy Kan A.H.G., Zipkin P. Handbooks in operations research and management science. Logistics of production and inventory. Vol. 4:1993;North-Holland.
37. Leon V.J., Wu S.D, Storer R.H. Robustness measures and robust scheduling for job shop. Department of Industrial Engineering, Lehigh University, 1990.
38. Lin G.Y.J., Solberg J.J. Integrated shop-floor control using autonomous agents. IIE Transactions. 24:1992;57-71.
39. McKay K.N., Safayeni F.R., Buzacott J.A. Job-shop scheduling theory: what is relevant? Interfaces. 18:1988;84-90.
40. McKay K.N., Buzacott J.A., Safayeni F.R. The scheduler's knowledge of uncertainty: the missing link. Browne J. Knowledge-based production management systems. 1989;171-189 Elsevier.
41. McKay K.N., Morton T.E., Ramnath P. Aversion dynamics, Research Report. Memorial University of Newfoundland, St. Johns, Newfoundland, Canada, 1996.
42. Mehta S.V., Uzsoy R. Predictable scheduling of a single machine subject to breakdowns. International Journal of Computer-Integrated Manufacturing. 12:1999;15-38.
43. Mehta S.V., Uzsoy R. Predictable scheduling of a job shop subject to breakdowns. IEEE Transactions on Robotics and Automation. 14:1998;365-378.
44. Miyazaki S. One machine scheduling problem with dual criteria. Journal of the Operations Research Society of Japan. 24:1981;37-50.
45. Morton T.E., Lawrence S.R., Rajagopalan S., Kekre S. SCHED-STAR: a price-based shop scheduling module. Journal of Manufacturing and Operations Management. 1:1988;131-181.
46. Najmi A., Lozinski C. Managing factory productivity using object-oriented simulation for setting shift production targets in VLSI manufacturing. Proceedings of the Autofact Conference. 1989;3.1-3.14 Society of Manufacturing Engineers.
47. Nelson R.T., Sarin R.K., Daniels R.L. Scheduling with multiple performance measures: the one-machine case. Management Science. 32:1986;464-479.
48. Ovacik I.M., Uzsoy R. A shifting bottleneck algorithm for scheduling semiconductor testing operations. Journal of Electronics Manufacturing. 2:1992;119-134.
49. Ovacik I.M., Uzsoy R. Decomposition methods for complex factory scheduling problems. 1997;Kluwer Academic Publishers, Norwell, MA.
50. Pinedo M. Scheduling: theory, algorithms and systems. 1995;Prentice-Hall, NJ.
51. Potts C.N., Van Wassenhove L.N. An algorithm for single-machine sequencing with deadlines to minimize total weighted completion time. European Journal of Operational Research. 12:1983;379-387.
52. Potts C.N., Van Wassenhove L.N. Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. Journal of the Operational Research Society. 43:1992;395-406.
53. Ragatz G.L., Mabert V.A. An evaluation of order release mechanisms in a job shop environment. Decision Sciences. 19:1988;167-189.
54. Sadeh N. Look-ahead techniques for micro-opportunistic job shop scheduling, PhD Thesis. School of Computer Science, Carnegie-Mellon University, 1991.
55. Scudder G.D., Smith-Daniels D.E., Rohleder T. Use of the net present value criterion in a random job shop where early shipments are forbidden. Journal of Operations Management. 9:1990;526-547.
56. Sen T., Gupta S.K. A branch and bound procedure to solve a bicriterion scheduling problem. IIE Transactions. 15:1983;84-88.
57. Sen T., Raiszadeh F.M.E., Dileepan P. A branch and bound approach to the bicriterion scheduling problem involving total flow time and range of lateness. Management Science. 34:1988;254-260.
58. Smith SF. Knowledge-based production management: approaches, results and prospects. Center for Integrated Manufacturing Decision Systems, The Robotics Institute, Carnegie-Mellon University, Pittsburgh, PA 15213, 1991.
59. Smith S.F. A methodology and architecture for reactive scheduling. Scherer W.T., Brown D.E. Proceedings of the Intelligent Scheduling Systems Symposium, San Francisco, CA. 1992;66-81.
60. Smith S.F., Keng N., Kempf K. Exploiting local flexibility during execution of pre-computed schedules. Famili A., Nau D.S., Kim S.H. Artificial intelligence applications in manufacturing. 1992;AAAI Press/MIT Press.
61. Smith W.E. Various optimizers for single-stage production. Naval Research Logistics Quarterly. 3:1956;59-66.
62. Sullivan G., Fordyce K. IBM burlington's logistics management system. Interfaces. 20(1):1990;43-64.
63. Van Wassenhove L.N., Gelders L.F. Solving a bicriterion scheduling problem. European Journal of Operational Research. 4:1980;42-48.
64. Wein L.M. Due-date setting and priority sequencing in a multiclass M/G/1 queue. Management Science. 37(7):1991;834-850.
65. Wein L.M., Chevalier P.B. A broader view of the job-shop scheduling problem. Management Science. 38:1992;1018-1033.
66. Wu S.D., Storer R.H., Chang P.C. One machine rescheduling heuristics with efficiency and stability as criteria. Computers and Operations Research. 20:1993;1-14.