IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v52y2004i3p440-453.html
   My bibliography  Save this article

Rescheduling for New Orders

Author

Listed:
  • Nicholas G. Hall

    (Department of Management Sciences, Fisher College of Business, The Ohio State University, Columbus, Ohio 43210-1144)

  • Chris N. Potts

    (School of Mathematics, University of Southampton, Southampton, United Kingdom SO17 1BJ)

Abstract

This paper considers scheduling problems where a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives and creates a disruption. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. Two classes of models are considered. First, we minimize the scheduling cost of all the jobs, subject to a limit on the disruption caused to the original schedule, where this disruption is measured in various ways. In the second class, a total cost objective, which includes both the original cost measure and the cost of disruption, is minimized. For both classes and various costs based on classical scheduling objectives, and for almost all problems, we provide either an efficient algorithm or a proof that such an algorithm is unlikely to exist. We also show how to extend both classes of models to deal with multiple disruptions in the form of repeated arrivals of new jobs. Our work refocuses the extensive literature on scheduling problems towards issues of rescheduling, which are important because of the frequency with which disruptions occur in manufacturing practice.

Suggested Citation

  • Nicholas G. Hall & Chris N. Potts, 2004. "Rescheduling for New Orders," Operations Research, INFORMS, vol. 52(3), pages 440-453, June.
  • Handle: RePEc:inm:oropre:v:52:y:2004:i:3:p:440-453
    DOI: 10.1287/opre.1030.0101
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1030.0101
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.1030.0101?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. James C. Bean & John R. Birge & John Mittenthal & Charles E. Noon, 1991. "Matchup Scheduling with Multiple Resources, Release Dates and Disruptions," Operations Research, INFORMS, vol. 39(3), pages 470-483, June.
    2. Ali Tamer Unal & Reha Uzsoy & Ali Kiran, 1997. "Rescheduling on a single machine with part-type dependent setup times and deadlines," Annals of Operations Research, Springer, vol. 70(0), pages 93-113, April.
    3. Koulamas, Christos & Kyparisis, George J., 2001. "Single machine scheduling with release times, deadlines and tardiness objectives," European Journal of Operational Research, Elsevier, vol. 133(2), pages 447-453, January.
    4. Michael R. Garey & Robert E. Tarjan & Gordon T. Wilfong, 1988. "One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 330-348, May.
    5. Richard L. Daniels & Panagiotis Kouvelis, 1995. "Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production," Management Science, INFORMS, vol. 41(2), pages 363-376, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M Ozlen & M Azizoğlu, 2011. "Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 152-164, January.
    2. Wenchang Luo & Rylan Chin & Alexander Cai & Guohui Lin & Bing Su & An Zhang, 2022. "A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 690-722, August.
    3. Yin, Yunqiang & Cheng, T.C.E. & Wang, Du-Juan, 2016. "Rescheduling on identical parallel machines with machine disruptions to minimize total completion time," European Journal of Operational Research, Elsevier, vol. 252(3), pages 737-749.
    4. Liu, Zhixin & Lu, Liang & Qi, Xiangtong, 2018. "Cost allocation in rescheduling with machine unavailable period," European Journal of Operational Research, Elsevier, vol. 266(1), pages 16-28.
    5. Nicholas G. Hall & Chris N. Potts, 2010. "Rescheduling for Job Unavailability," Operations Research, INFORMS, vol. 58(3), pages 746-755, June.
    6. Aytug, Haldun & Lawley, Mark A. & McKay, Kenneth & Mohan, Shantha & Uzsoy, Reha, 2005. "Executing production schedules in the face of uncertainties: A review and some future directions," European Journal of Operational Research, Elsevier, vol. 161(1), pages 86-110, February.
    7. Alagoz, Oguzhan & Azizoglu, Meral, 2003. "Rescheduling of identical parallel machines under machine eligibility constraints," European Journal of Operational Research, Elsevier, vol. 149(3), pages 523-532, September.
    8. Qiulan Zhao & Lingfa Lu & Jinjiang Yuan, 2016. "Rescheduling with new orders and general maximum allowable time disruptions," 4OR, Springer, vol. 14(3), pages 261-280, September.
    9. Cowling, Peter & Johansson, Marcus, 2002. "Using real time information for effective dynamic scheduling," European Journal of Operational Research, Elsevier, vol. 139(2), pages 230-244, June.
    10. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    11. Qi, Xiangtong & Bard, Jonathan F. & Yu, Gang, 2006. "Disruption management for machine scheduling: The case of SPT schedules," International Journal of Production Economics, Elsevier, vol. 103(1), pages 166-184, September.
    12. Nicholas G. Hall & Zhixin Liu & Chris N. Potts, 2007. "Rescheduling for Multiple New Orders," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 633-645, November.
    13. Michele E. Pfund & John W. Fowler, 2017. "Extending the boundaries between scheduling and dispatching: hedging and rescheduling techniques," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3294-3307, June.
    14. Baptiste, Philippe & Sadykov, Ruslan, 2010. "Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars," European Journal of Operational Research, Elsevier, vol. 203(2), pages 476-483, June.
    15. Azeddine Cheref & Alessandro Agnetis & Christian Artigues & Jean-Charles Billaut, 2017. "Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence," Journal of Scheduling, Springer, vol. 20(6), pages 681-693, December.
    16. Kolahan, F. & Liang, M., 1998. "An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 109(1), pages 142-159, August.
    17. Kyung Sung Jung & Milind Dawande & H. Neil Geismar & V. Daniel R. Guide & Chelliah Sriskandarajah, 2016. "Supply planning models for a remanufacturer under just-in-time manufacturing environment with reverse logistics," Annals of Operations Research, Springer, vol. 240(2), pages 533-581, May.
    18. Şeker, Merve & Noyan, Nilay, 2012. "Stochastic optimization models for the airport gate assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 438-459.
    19. Herroelen, Willy & Leus, Roel, 2004. "The construction of stable project baseline schedules," European Journal of Operational Research, Elsevier, vol. 156(3), pages 550-565, August.
    20. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:52:y:2004:i:3:p:440-453. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.