Improving scheduling robustness via preprocessing and dynamic adaptation

IIE Transactions (Institute of Industrial Engineers)

Volumn 36, Issue 11, 2004, Pages 1107-1124

  Kutanoglu, Erhan ^a   Wu, S David ^b  

^a The University of Texas at Austin   (United States)

^b Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; RANDOM PROCESSES;

DYNAMIC ADAPTATION; JOB SHOP SCHEDULING PROBLEM; LAGRANGIAN RANKING; LAGRANGIAN RELAXATION; SCHEDULING ROBUSTNESS;

SCHEDULING;

EID: 4744347235     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170490500681     Document Type: Article

References (31)

1. Anon (1995) Using the CPLEX base system including CPLEX mixed integer solver and barrier solver options, IL06 Inc.
2. Baptiste, P. and Favrel, J. (1993) Taking into account the rescheduling problem during the scheduling phase. Production Planning and Control, 4, 349-360.
3. Bean, J.C., Birge, J.R., Mittenthal, J. and Noon, C.E. (1991) Matchup scheduling with multiple resources, release dates and disruptions. Operations Research, 39(3), 470-483.
4. Byeon, E.S., Wu, S.D. and Storer, R.H. (1998) Decomposition heuristics for robust job-shop scheduling. IEEE Transactions on Robotics and Automation, 14(2), 303-313.
5. Charnes, A. and Cooper, W.W. (1959) Chance-constrained programming. Management Science, 6, 73-79.
6. Church, L.K. and Uzsoy, R. (1992) Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Journal of Computer Integrated Manufacturing, 5, 153-163.
7. Fourer, R., Gay, D.M. and Kernighan, B.W. (1993) AMPL: A Modeling Language for Mathematical Programming. Boyd and Fraser Publishing Company, Danvers, MA.
8. Gallego, G. (1988a) Linear control policies for scheduling a single facility after an initial disruption. Technical Report 770, Cornell University, Ithaca, NY.
9. Gallego, G. (1988b) Produce-up-to policies for scheduling a single facility after an initial disruption. Technical report 771, Cornell University, Ithaca, NY.
10. Kouvelis, D. and Yu, G. (1996) Robust Discrete Optimization and Its Applications, Kluwer, Boston, MA.
11. Kutanoglu E. and Sabuncuoglu, I. (2001) Experimental investigation of iterative simulation-based scheduling in dynamic and stochastic job shops. Journal of Manufacturing Systems, 20(4), 264-279.
12. Kutanoglu, E. and Wu, S.D. (2002) Scaling-based heuristics for job shop scheduling under deterministic and stochastic conditions. Technical report, Operations Research and Industrial Engineering Program, Department of Mechanical Engineering, The University of Texas at Austin, Austin, TX.
13. Lawrence, S.R. and Sewell, E.C. (1997) Heuristic, optimal, static, and dynamic schedules when processing times are uncertain. Journal of Operations Management, 15, 71-82.
14. Leon, V.J., Wu, S.D. and Storer R.H. (1994) Robustness measures and robust scheduling. IIE Transactions, 26(5), 32-43.
15. Ling, R. and Kutanoglu, E. (2002) A scaling-based heuristic for resource-constrained project scheduling problems. Technical report, Operations Research and Industrial Engineering Program, Department of Mechanical Engineering, The University of Texas, Austin, TX.
16. Maddox, M.J. and Birge, J.R. (1992) Using second moment information in stochastic scheduling, in Recent Advances in Control and Optimization of Manufacturing Systems, Yin, G. and Zhang, Q. (eds.), Springer-Verlag, pp. 99-120.
17. Mehta, S.V. and Uzsoy, R. (1997) Predictable scheduling of a job-shop subject to breakdowns. IEEE Transactions on Robotics and Automation, 14, 149-156.
18. Morton, T.E., Lawrence, S., Rajagopalan, S. and Kekre, S. (1986) MRP-STAR PATRIARCH's planning module. Working paper, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
19. Morton, T.E., Lawrence, S., Rajagopalan, S. and Kekre, S. (1988) A price-based shop scheduling module. Working paper, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
20. Muhlemann, A.P., Lockett, A.G. and Farn C.K. (1982) Job shop scheduling heuristic and frequency of scheduling. International Journal of Production Research, 20(2), 227-241.
21. Muth, J.F. and Thompson, G.L. (1963) Industrial Scheduling, Prentice Hall, Englewood Cliffs, NJ.
22. Parker, R.G. and Rardin, R.L. (1988) Discrete Optimization, Academic Press, San Diego, CA.
23. Pinedo, M. (2001) Scheduling: Theory, Algorithms and Systems, 2nd edn., Prentice Hall, Englewood Cliff's, NJ.
24. Pritsker, A., Watters, L. and Wolfe, P. (1969) Multiproject scheduling with limited resources: a zero-one programming approach. Management Science: Theory, 16(1), 93-108.
25. Roundy, R.O., Maxwell, W.L., Herer, Y.T., Tayur, S.R. and Getzler, A.W. (1991) A price-directed approach to real-time scheduling of production operations. IIE Transactions, 23(2), 149-160.
26. Vepsalainen, A.P.J. and Morton, T.E. (1987) Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035-1047.
27. Wolsey, L.A. (1998) Integer Programming, J Wiley, New York, NY.
28. Wu, S.D., Byeon, E.S. and Storer, R.H. (1999) A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Operations Research, 47(1), 113-124.
29. Wu, S.D., Storer, R.H. and Chang, P.C. (1992) A rescheduling procedure for manufacturing systems under random disruptions, in New Directions for OR in Manufacturing, Springer-Verlag.
30. Wu, S.D., Storer, R.H. and Chang, P.C. (1993) One machine rescheduling heuristics with efficiency and stability as criteria. Computers & Operations Research, 20, 1-14.
31. Yamamoto, M. and Nof, S.Y. (1985) Scheduling/rescheduling in the manufacturing operating system environment. International Journal of Production Research, 23(4), 705-722.