Skip to main content
SpringerLink
Log in

Rescheduling problems with allowing for the unexpected new jobs arrival

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In modern manufacturing and services, rescheduling frequently happens in manufacturing practice, which a disruption may happen. In this paper, the rescheduling problem with the unexpected new jobs arrival is studied, and the effect of time disruptions is taken into account on a previously planned optimal schedule. Rescheduling means that a set of original jobs has already given jobs sequence by minimizing some classical objective, then a set of new jobs arrived will create a time disruption for the original jobs. Our focus is to find a feasible rescheduling to minimize maximum weighted tardiness costs under a limit of time disruptions from the original schedule. Two time disruption problems will be involved: under an upper restriction of the total time disruption and relaxing time disruption restriction. For the former case, the proof of strongly NP-hard by reducing 3-Partition problem is presented. For latter case, a strongly NP-hard proof is also given,and then a two-approximation polynomial time algorithm is presented to confirm that the latter problem has not an approximation polynomial-time algorithm, which a performance ratio is less than 2 unless \(P=NP\). Finally, one of the proposed algorithms is improved by three local searches, respectively, as three seeds used in simulated annealing for approximate solution. Furthermore, we also present some extensive numerical experiment to evaluate their performance.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Akram K, Kamal K (2016) Fast simulated annealing hybridized with quenching for solving job shop scheduling problem. Appl Soft Comput 49:510–523

    Article  Google Scholar 

  • Aytug H, Lawley MA, McKay K, Mohan S, Uzsoy R (2005) Executing production schedules in the face of uncertainties: a review and some future direction. Eur J Oper Res 161:86–110

    Article  MathSciNet  Google Scholar 

  • Ballestn F, Prez (2019) Quintanilla S. Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients. J Schedul 22:107–118

    Article  Google Scholar 

  • Della Croce F, Narayan V, Tadei R (1996) The two-machine total completion time flow shop problem. Eur J Oper Res 90:227–237

    Article  Google Scholar 

  • Fisher ML (1976) A dual algorithm for the one-machine scheduling problem. Math Program 11:229–251

    Article  MathSciNet  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Franciso

    MATH  Google Scholar 

  • Guo QZ, Tang LX (2019) Modelling and discrete differential evolution algorithm for order rescheduling problem in steel industry. Computers Indust Eng 130:586–596

    Article  Google Scholar 

  • Hall NG, Potts CN (2004) Rescheduling for new orders. Oper Res 52:440–453

    Article  MathSciNet  Google Scholar 

  • Hall NG, Potts CN (2010) Rescheduling for job unavailability. Oper Res 58:746–755

    Article  MathSciNet  Google Scholar 

  • Hao X, Gen M, Lin L, Suer GA (2017) Effective multiobjective EDA for bi-criteria stochastic job-shop scheduling problem. J Intell Manuf 28(3):833–845

    Article  Google Scholar 

  • Hoogeveen H, Lente C, Tkindt V (2012) Rescheduling for new orders on a single machine with setup times. Eur J Oper Res 223:40–46

    Article  MathSciNet  Google Scholar 

  • Kang YH, Zhang XG (2018) A single machine rescheduling problems with deteriorating jobs under sequence disruptions. J Syst Sci Complex 38(4):511–520

    MathSciNet  MATH  Google Scholar 

  • Katragjini K, Vallada E, Ruiz R (2013) Flow shop rescheduling under different types of disruption. Int J Prod Res 51:780–797

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  Google Scholar 

  • Lawler EL (1973) Optimal sequencing of a single machine subject to precedence constraints. Manag Sci 19:544–546

    Article  Google Scholar 

  • Lawler EL (1977) A pseudopolynomial time algorithm for sequencing jobs to minimize total tardiness. Annal Discret Math 1:331–342

    Article  Google Scholar 

  • Li CL, Li F (2020) Rescheduling production and outbound deliveries when transportation service is disrupted. Eur J Oper Res 90:138–148

    Article  MathSciNet  Google Scholar 

  • Liu L, Zhou H (2015) Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption. Int J Syst Sci 46:2640–2658

    Article  MathSciNet  Google Scholar 

  • Luo WC, Luo TB, Goebel R, Lin GH (2018) Rescheduling due to machine disruption to minimize the total weighted completion time. J Schedul 21:565–578

    Article  MathSciNet  Google Scholar 

  • Luo WC, Ji M, Su B, Lin GH (2020) An approximation scheme for rejection-allowed single machine rescheduling. Computers Indust Eng 146:106574

    Article  Google Scholar 

  • Moschakis IA, Karatza HD (2015) Multi-criteria scheduling of Bag-of-Tasks applications on heterogeneous interlinked clouds with simulated annealing. J Syst Softw 101:1–14

    Article  Google Scholar 

  • Taghi Assadi M, Bagheri M (2016) Differential evolution and Population-based simulated annealing for truck scheduling problem in multiple door cross-docking systems. Computers Indust Eng 96:149–161

    Article  Google Scholar 

  • Teghem J, Tuyttens D (2014) A bi-objective approach to reschedule new jobs in a one machine model. Int Transactions Oper Res 21:871–898

    Article  MathSciNet  Google Scholar 

  • Uhlmann IR, Frazzon EM (2018) Production rescheduling review: opportunities for industrial integration and practical applications. J Manuf Syst 49:186–193

    Article  Google Scholar 

  • Valledora P, Gomez A, Prioreb P, Puente J (2018) Solving multi-objective rescheduling problems in dynamic permutation flow shop environments with disruptions. Int J Prod Res 56(19):6363–6377

    Article  Google Scholar 

  • Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies and methods. J Schedul 6:39–62

    Article  MathSciNet  Google Scholar 

  • Wang DJ, Yin YQ, Cheng TCE (2018) Parallel-machine rescheduling with job unavailability and rejection. Omega 81:246–260

    Article  Google Scholar 

  • Wu CC, Wang DJ, Cheng SR, Chung IH, Lin WC (2018) A two-stage three-machine assembly scheduling problem with a position-based learning effect. Int J Prod Res 56(9):3064–3079

    Article  Google Scholar 

  • Xiao J, Yang C, Zheng L, Gupta JND (2015) A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Computers Oper Res 63:72–82

    Article  MathSciNet  Google Scholar 

  • Yang J (2018) Rescheduling a single machine with various objectives. Indust Eng Manag Syst 17(4):805–818

    Google Scholar 

  • Yang BB (2009) Single machine rescheduling with new jobs arrivals and processing time compression. Int J Adv Manuf Technol 34:378–384

    Article  Google Scholar 

  • Yuan JJ, Mu YD (2007) Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. Eur J Oper Res 182:936–944

    Article  Google Scholar 

  • Zhao QL, Lu LF, Yuan JJ (2016) Rescheduling with new orders and general maximum allowable time disruptions. 4OR-Q J Oper Res 14(3):261–280

    Article  MathSciNet  Google Scholar 

  • Zhao CL, Tang HY (2010) Rescheduling problems with deteriorating jobs under disruptions. Appl Math Model 34:238–243

    Article  MathSciNet  Google Scholar 

  • Zhao QL, Yuan JJ (2013) Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption. J Schedul 16:253–260

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China (11991022, 11571321, 715610007), and Key Research fund Projects of Chongqing Graduate Education and Teaching Reform (yjg182019); and in part by the Ministry of Science and Technology of Taiwan (MOST 110-2221-E-035-082-MY2).

Author information

Authors and Affiliations

  1. College of Mathematics Science, Chongqing Normal University, Chongqing, China

    Xingong Zhang

  2. Department of Statistics, Feng Chia University, Taichung, Taiwan

    Win-Chin Lin & Chin-Chia Wu

Authors
  1. Xingong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Win-Chin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chin-Chia Wu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, X., Lin, WC. & Wu, CC. Rescheduling problems with allowing for the unexpected new jobs arrival. J Comb Optim 43, 630–645 (2022). https://doi.org/10.1007/s10878-021-00803-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-021-00803-4

Keywords

Search

Navigation