Skip to main content
Log in

Two Machine Scheduling under Disruptions with Transportation Considerations

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Effective logistics scheduling requires synchronization of manufacturing and delivery to optimize customer service at minimum total cost. In this paper, we study a new scheduling problem that arises in a disruption environment. Such a problem occurs when a disruption unexpectedly happens, and consequently, some machines become unavailable for certain periods. Jobs that are assigned to the disrupted machines and have not yet been processed can either be moved to other available machines for processing, which may involve additional transportation time and cost, or can be processed by the same machine after the disruption. Our goal is to reschedule jobs so that an objective function, including the original cost function, and possibly transportation costs and disruption cost caused by deviating from the originally planned completion times, is minimized. In this paper, we focus on the two-machine case to demonstrate some major properties, and hope that these properties can provide insights for solving other general problems, such as multiple (more than two) machine scheduling and machine scheduling in other configurations (job shop or flow shop) under disruption. We study problems with different related costs. In each problem, we either provide a polynomial algorithm to solve the problem optimally, or show its NP-hardness. If the problem is NP-hard in the ordinary sense, we also present a pseudo-polynomial algorithm to solve the problem optimally.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Adiri, I., J. Bruno, E. Frostig, and A. H. G. Rinnooy Kan, “Single Machine Flow-Time Scheduling with a Single Breakdown,” Acta Informatica, 26, 679–696 (1989).

    Article  Google Scholar 

  • Akturk, M. S. and E. Gorgulu, “Match-up Scheduling under a Machine Breakdown,” European Journal of Operational Research, 112, 81–97 (1999).

    Article  Google Scholar 

  • Arguello, M. F., J. F. Bard, and G. Yu, “A GRASP for Aircraft Routing in Response to Groundings and Delays,” Journal on Combinatorial Optimization 5, 211–228 (1997).

    Google Scholar 

  • Aytug, H., M. A. Lawley, K. McKay, S. Mohan, and R. Uzsoy, “Executing Production Schedules in the Face of Uncertainties: A Review and Some Future Directions,” to appear in European Journal of Operational Research (2002).

  • Bean, J. C., J. R. Birge, J. Mittenthal, and C.E. Noon, “Matchup Scheduling with Multiple Resources, Release Dates and Disruptions,” Operations Research, 39, 470–483 (1991).

    Google Scholar 

  • Birge, J. and K. D. Glazebrook, “Assessing the Effects of Machine Breakdowns in Stochastic Scheduling,” Operations Research Letters, 7, 267–271 (1988).

    Article  Google Scholar 

  • Birge, J., J. B. G. Frenk, J. Mittenthal, and A. H. G. Rinnooy Kan, “Single-Machine Scheduling Subject to Stochastic Breakdowns,” Naval Research Logistics, 37, 661–677 (1990).

    Google Scholar 

  • Blazewicz J., K. Ecker, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes, 2nd Edition, Springer-Verlag, Berlin (2001).

    Google Scholar 

  • Brucker, P., Scheduling Algorithm, 2nd Edition, Springer-Verlag, Berlin (1998).

    Google Scholar 

  • Chen, C. -L. and R. L. Bulfin, “Complexity of Single Machine, Multi-Criteria Scheduling Problems,” European Journal of Operational Research, 70, 115–125 (1993).

    Google Scholar 

  • Clausen, J. J., J. Hansen, J. Larsen, and A. Larsen, “Disruption Management,” ORMS Today, 28, 40–43 (2001).

    Google Scholar 

  • Frostig, E., “A Note on Stochastic Scheduling on a Single Machine Scheduling Subject to Breakdown-The Preemptive Repeat Model,” Probability in the Engineering and Informational Sciences, 5, pp. 349–354 (1991).

    Google Scholar 

  • Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979).

    Google Scholar 

  • Glazebrook, K. D., “Evaluating the Effects of Machine Breakdowns in Stochastic Scheduling Problems,” Naval Research Logistics, 34, 319–335 (1987).

    Google Scholar 

  • Golany, B., Y. Xia, J. Yang, and G. Yu, “An Iterative Goal-Programming Procedure for Operational Recovery Problems,” Journal of Optimization and Engineering, 3, 109–127 (2002).

    Google Scholar 

  • Graves, G. H. and C. -Y. Lee, “Scheduling Maintenance and Semiresumable Jobs on a Single Machine,” Naval Research Logistics, 46, 845–863 (1999).

    Article  Google Scholar 

  • Hall, N. G., M. A. Lesaoana, and C. N. Potts, “Scheduling with Fixed Delivery Dates,” Operations Research, 49, 134–144 (2001).

    Article  Google Scholar 

  • Hall, N. G. and C. N. Potts, “Supply Chain Scheduling: Batching and Delivery,” Operations Research, 51, 385–407 (2003).

    Article  Google Scholar 

  • Hurink, J. and S. Knust, “Flow-shop Problems with Transportation Times and a Single Robot,” Preprints 1998, Fachbereich Mathematik/Informatik, Universitat Osnabruck (1998).

  • Jarrah, A. I. Z., G. Yu, N. Krishnamurthy, and A. Rakshit, “A Decision Support Framework for Airline Flight Cancellations and Delays,” Transportation Science, 27, 266–280 (1993).

    Google Scholar 

  • Lee, C.-Y., “A Solution to the Multiple Set—Up Problem with Dynamic Demand,” IIE Transactions, 21, 266–270 (1989).

    Google Scholar 

  • Lee, C.-Y., “Machine Scheduling with Availability Constraints,” in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Joseph Leung (Ed.), CRC Press 22.1–22.13 (2004).

  • Lee, C. -Y. and Z. L. Chen, “Machine Scheduling with Transportation Considerations,” Journal of Scheduling, 4, 3–24 (2001).

    Article  Google Scholar 

  • Lee, C. -Y. and C. -S. Lin, “Machine Scheduling with Maintenance and Repair Rate-Modifying Activities,” European Journal of Operational Research, 135, 491–513 (2001).

    Google Scholar 

  • Leon, V. J. and S. D. Wu, “On Scheduling with Ready-Times, Due-Dates and Vacations,” Naval Res. Logist. 39, 53–65 (1992).

    Google Scholar 

  • Leon, V. J., S. D. Wu, and R. H. Storer, “A Game-Theoretic Control Approach for Job Shops in the Presence of Disruption,” International Journal of Production Research, 32, 1451–1476 (1994).

    Google Scholar 

  • Luo, S. and G. Yu, “On the Airline Schedule Perturbation Problem Caused by the Ground Delay Program,” Transportation Science, 31, 298–311 (1997).

    Article  Google Scholar 

  • Pinedo, M. L., Scheduling: Theory, Algorithms and Systems, 2nd Edition, Prentice-Hall, Englewood Cliffs, NJ (2002).

    Google Scholar 

  • Pinedo, M. L. and E. Rammouz, “A Note on Stochastic Scheduling Machine Subject to Breakdown and Repair,” Probability in the Engineering and Informational Sciences, 2, 41–49 (1988).

    Article  Google Scholar 

  • Qi, X., T. Chen, and F. Tu, “Scheduling the Maintenance on a Single Machine,” Journal of the Operational Research Society, 50, 1071–1078 (1999).

    Google Scholar 

  • Qi, X., J. F. Bard, and G. Yu, “Disruption Management for Machine Scheduling,” International Journal of Production Economics, accepted for publication (2005).

  • Qin, S. Z. and G. Yu, “Fab-wide Control and Disruption Management in High-Volume Semiconductor Manufacturing,” NSF Grant 04–532 (2004).

  • Schmidt, G., “Scheduling with Limited Machine Availability,” European Journal of Operational Research, 121, 1–15 (2000).

    Article  Google Scholar 

  • Teodorovic, D. and S. Guberinic, “Optimal Dispatching Strategy on an Airline Network after a Schedule Perturbation,” European Journal of Operational Research, 15, 178–182 (1984).

    Article  Google Scholar 

  • Thengvall, B., J. F. Bard, and G. Yu, “Balancing User Preferences for Aircraft Recovery during Airline Irregular Operations,” IIE Transaction, 32, 181–193 (2000).

    Google Scholar 

  • “Trial by Fire: A Blaze in Albuquerque Sets Off Major Crisis,” The Wall Street Journal, 1/29/2001, Page A1.

  • Unal, A. T., R. Uzsoy, and A. S. Kiran, “Rescheduling on a Single Machine with Part-Type Dependent Setup Times and Deadlines,” Annals of Operations Research, 70, 93–113 (1997).

    Google Scholar 

  • Vieira, G. E., J. Herrmann, and E. Lin, “Rescheduling Manufacturing Systems: A Framework of Strategies Policies, and Methods,” Working Paper, The Institute of Systems Research, The University of Maryland (2002).

  • Yan, S. and D. Yang, “A Decision Support Framework for Handling Schedule Perturbations,” Transportation Research—Part B: Methodology, 30, 405–419 (1996).

    Google Scholar 

  • Yu, G., M. Arguello, S. McCowan, M. Song, and A. White, “A New Era for Crew Recovery at Continental Airlines,” Interfaces, 33, 5–22 (2003).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chung-Yee Lee.

Additional information

This research is supported in part by Hong Kong RGC grant HKUST 6145/03E and in part by NSF Grant DMI-0300156.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, CY., Leung, J.YT. & Yu, G. Two Machine Scheduling under Disruptions with Transportation Considerations. J Sched 9, 35–48 (2006). https://doi.org/10.1007/s10951-006-5592-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-006-5592-7

Keywords

Navigation