Abstract
We investigate the problem of integrating new rush orders into the current schedule of a real world job shop floor. Satisfactory rescheduling methods must keep stability of the shop, by introducing the fewest number of changes in the ordering of operations, while maintaining the same levels of the schedule performance criteria. This paper introduces a number of match-up strategies that modify only part of the schedule in order to accommodate new arriving jobs. These strategies are compared with the right-shift and the total-rescheduling methods, which are optimal regarding stability and performance, but ineffective for performance and stability, respectively. Statistical analysis indicates that the match-up strategies are comparable to right-shift for stability, and as good as total-rescheduling for performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Vieira, G., Herrmann, J., Lin, E.: Rescheduling manufacturing systems: A framework of strategies, policies and methods. Journal of Scheduling 6(1), 39–62 (2003)
Aytug, H., Lawley, M., McKay, K., Mohan, S., Uzsoy, R.: Executing production schedules in the face of uncertainties: A review and some future directions. European Journal of Operational Research 161(1), 86–110 (2005)
Bean, J., Birge, J.: Match-up real-time scheduling. In: Proceedings of the Symposium on Real-Time Optimization in Automated Manufacturing Facilities, National Bureau of Standards, Special Publication 724, pp. 197–212 (1986)
Bean, J., Birge, J., Mittenthal, J., Noon, C.: Matchup scheduling with multiple resources, release dates and disruptions. Operations Research 39(3), 470–483 (1991)
Birge, J., Dempster, M.: Optimality conditions for match-up strategies in stochastic scheduling. Technical Report 92 - 58, Department of Industrial and Operations Engineering, The University of Michigan (1992)
Birge, J., Dempster, M.: Optimal match-up strategies in stochastic scheduling. Discrete Applied Mathematics 57(2-3), 105–120 (1995)
Akturk, M., Gorgulu, E.: Match-up scheduling under a machine breakdown. European Journal of Operational Research 112(1), 81–97 (1999)
Smith, S., Muscettola, N., Matthys, D., Ow, P., Potvin, J.: Opis: an opportunistic factory scheduling system. In: IEA/AIE 1990: Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems, pp. 268–274. ACM Press, New York (1990)
Sadeh, N.: Micro-opportunistic scheduling: The micro-boss factory scheduler. In: Intelligent Scheduling, ch. 4, pp. 99–136. Morgan Kaufmann, San Francisco (1994)
Smith, S.: Reactive scheduling systems. In: Brown, D., Scherer, W. (eds.) Intelligent Scheduling Systems, Kluwer Academic Publishers, Dordrecht (1995)
Sun, J., Xue, D.: A dynamic reactive scheduling mechanism for responding to changes of production orders and manufacturing resources. Computers in Industry 46(2), 189–207 (2001)
Abumaizar, R., Svestka, J.: Rescheduling job shops under random disruptions. International Journal of Production Research 35(7), 2065–2082 (1997)
Wu, S., Storer, R., Chang, P.: One-machine rescheduling heuristics with efficiency and stability as criteria. Computers and Operations Research 20(1), 1–14 (1993)
Petrovic, S., Fayad, C., Petrovic, D., Burke, E., Kendall, G.: Fuzzy job shop scheduling with lot-sizing. Annals of Operations Research 159(1), 275–292 (2008)
Miller, R.: Simultaneous Statistical Inference. Springer, New York (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moratori, P., Petrovic, S., Vázquez, A. (2008). Match-Up Strategies for Job Shop Rescheduling. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds) New Frontiers in Applied Artificial Intelligence. IEA/AIE 2008. Lecture Notes in Computer Science(), vol 5027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69052-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-69052-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69045-0
Online ISBN: 978-3-540-69052-8
eBook Packages: Computer ScienceComputer Science (R0)