An Improved Algorithm based on Constraint Programming for Job Shop Rescheduling Problem with New Job Insertion

Peng Yun-fang, Su Chen

Abstract

Due to a variety of unexpected situations, the shop needs to make adjustments on the original schedule. Aiming at job shop rescheduling caused by new job arrival, we build an optimal model based constraint programming to make a reschedule to minimize the makespan. And considering the advantage of constraint programming in solving combinatorial optimization problems, we combined constraint propagation techniques with construction search strategy, a rescheduling algorithm based on constraint programming is designed. Computational experiments of rescheduling problems are generated based on the benchmark of Job shop scheduling problem. Results reveal the proposed algorithm can solve the instances in short time.

References

  1. Bierwirth C, Mattfeld D C. 1999. Production scheduling and rescheduling with genetic algorithms [J]. Evolutionary computation, 7(1): 1-17.
  2. Fang J, Xi Y., 1997. A rolling horizon job shop rescheduling strategy in the dynamic environment [J]. The International Journal of Advanced Manufacturing Technology, 13(3): 227-232.
  3. Rangsaritratsamee R, Ferrell W G, Kurz M B., 2004. Dynamic rescheduling that simultaneously considers efficiency and stability [J]. Computers & Industrial Engineering, 46(1): 1-15.
  4. Katragjini K, Vallada E, Ruiz R., 2013. Flow shop rescheduling under different types of disruption [J]. International Journal of Production Research, 51(3): 780-797.
  5. Zhang L, Gao L, Li X., 2013. A hybrid intelligent algorithm and rescheduling technique for job shop scheduling problems with disruptions [J]. The International Journal of Advanced Manufacturing Technology, 65(5-8): 1141-1156.
  6. Gao K Z, Suganthan P N, Pan Q K, et al., 2016. Artificial Bee Colony Algorithm for Scheduling and Rescheduling Fuzzy Flexible Job Shop Problem with New Job Insertion [J]. Knowledge-Based Systems, 109:1-16.
  7. Nuijten W, Pape C L., 1998. Constraint-based job shop scheduling with ILOG SCHEDULER [J]. Journal of Heuristics , 3(4):271-286.
  8. Sahraeian R, Namakshenas M., 2014. On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: Constraint programming vs. mixed integer programming [J]. Applied Mathematical Modelling, 39(2):955-964.
  9. Moukrim A, Quilliot A, Toussaint H., 2015. Branch and price with constraint propagation for Resource Constrained Project Scheduling Problem[C]//International Conference on Control, Decision and Information Technologies (CoDIT), 2014. IEEE,: 164-169.
  10. Lacomme P, Tchernev N, Huguet M J., 2011. Dedicated constraint propagation for Job-Shop problem with generic time-lags[C]//Emerging Technologies & Factory Automation (ETFA), 2011 IEEE 16th Conference on. IEEE: 1-7.
Download


Paper Citation


in Harvard Style

Yun-fang P. and Chen S. (2016). An Improved Algorithm based on Constraint Programming for Job Shop Rescheduling Problem with New Job Insertion . In ISME 2016 - Information Science and Management Engineering IV - Volume 1: ISME, ISBN 978-989-758-208-0, pages 68-73. DOI: 10.5220/0006443900680073


in Bibtex Style

@conference{isme16,
author={Peng Yun-fang and Su Chen},
title={An Improved Algorithm based on Constraint Programming for Job Shop Rescheduling Problem with New Job Insertion},
booktitle={ISME 2016 - Information Science and Management Engineering IV - Volume 1: ISME,},
year={2016},
pages={68-73},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006443900680073},
isbn={978-989-758-208-0},
}


in EndNote Style

TY - CONF
JO - ISME 2016 - Information Science and Management Engineering IV - Volume 1: ISME,
TI - An Improved Algorithm based on Constraint Programming for Job Shop Rescheduling Problem with New Job Insertion
SN - 978-989-758-208-0
AU - Yun-fang P.
AU - Chen S.
PY - 2016
SP - 68
EP - 73
DO - 10.5220/0006443900680073