Abstract
Permutation flowshop scheduling problem (PFSP) has attracted lots of attention from both academia and industry as it finds many applications especially for today’s mass customization. The PFSP is proved NP-hard, and the dynamic uncertainties such as stochastic new order arrivals significantly increase the problem complexity and difficulty. Many enterprises often struggle to make decisions on accepting new orders and setting due dates for them due to lack of effective scheduling methods. To fill in the knowledge gap, this paper is to propose a new meta-heuristic algorithm which is based on a new enhanced destruction and construction method and a novel repair method while adopting the architecture of the iterated greedy algorithm. Statistical tests were conducted and results show that the new algorithm outperforms existing ones.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Xu J, Zhou X (2009) A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem. Inf Sci (Ny) 179:2997–3017
Liu CY, Chang SC (2000) Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Trans Robot Autom 16:408–419
Aghezzaf E, Van Landeghem H (2002) An integrated model for inventory and production planning in a two-stage hybrid production system. Int J Prod Res 40:4323–4339
Boukef H, Benrejeb M, Borne P (2007) A proposed genetic algorithm coding for flow-shop scheduling problems. Int J Comput Commun Control 2:229–240
Liao L, Huang C (2010) Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness. Appl Math Comput 217:557–567
Liu W, Jin Y, Price M (2017) A new improved NEH heuristic for permutation flowshop scheduling problems. Int J Prod Econ 193:21–30. https://doi.org/10.1016/j.ijpe.2017.06.026
Liu W, Jin Y, Price M (2016) A new Nawaz–Enscore–Ham-based heuristic for permutation flow-shop problems with bicriteria of makespan and machine idle time. Eng Optim 48:1808–1822
Ravindran D, Haq AN, Selvakuar SJ, Sivaraman · R (2005) Flow shop scheduling with multiple objective of minimizing makespan and total flow time. Int J Adv Manuf Technol 25:1007–1012. https://doi.org/10.1007/s00170-003-1926-1
Chakravorty A, Laha D (2017) A heuristically directed immune algorithm to minimize makespan and total flow time in permutation flow shops. Int J Adv Manuf Technol 93:3759–3776. https://doi.org/10.1007/s00170-017-0679-1
Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129
Vasiljevic D, Danilovic M (2015) Handling ties in heuristics for the permutation flow shop scheduling problem. J Manuf Syst 35:1–9
Rahman HF, Sarker R, Essam D (2015) A real-time order acceptance and scheduling approach for permutation flow shop problems. Eur J Oper Res 247:488–503
Perez-Gonzalez P, Framinan JM (2010) Setting a common due date in a constrained flowshop: a variable neighbourhood search approach. Comput Oper Res 37:1740–1748
Safari E, Sadjadi SJ (2011) A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown. Expert Syst Appl 38:2020–2029
Nandi A, Rogers P (2004) Using simulation to make order acceptance/rejection decisions. SIMULATION 80:131–142
Perez-Gonzalez P, Framinan JM (2015) Assessing scheduling policies in a permutation flowshop with common due dates. Int J Prod Res 53:5742–5754
Koch S, Wäscher G (2016) A grouping genetic algorithm for the order batching problem in distribution warehouses. J Bus Econ 86:131–153. https://doi.org/10.1007/s11573-015-0789-x
Kulak O, Sahin Y, Taner ME (2012) Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms. Flex Serv Manuf J 24:52–80. https://doi.org/10.1007/s10696-011-9101-8
Menéndez B, Pardo EG, Alonso-Ayuso A, Molina E, Duarte A (2017) Variable neighborhood search strategies for the order batching problem. Comput Oper Res 78:500–512. https://doi.org/10.1016/j.cor.2016.01.020
Menéndez B, Pardo EG, Sánchez-Oro J, Duarte A (2017) Parallel variable neighborhood search for the min–max order batching problem. Int Trans Oper Res 24:635–662. https://doi.org/10.1111/itor.12309
Ruiz R, Stützle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033–2049. https://doi.org/10.1016/j.ejor.2005.12.009
Aytug H, Lawley MA, McKay K, Mohan S, Uzsoy R (2005) Executing production schedules in the face of uncertainties: a review and some future directions. Eur J Oper Res 161:86–110
Herroelen W, Leus R (2004) Robust and reactive project scheduling: a review and classification of procedures. Int J Prod Res 42:1599–1620
Perez-Gonzalez P, Framinan JM (2009) Scheduling permutation flowshops with initial availability constraint: analysis of solutions and constructive heuristics. Comput Oper Res 36:2866–2876
Liu W, Jin Y, Price M (2017) New scheduling algorithms and digital tool for dynamic permutation flowshop with newly arrived order. Int J Prod Res 55:3234–3248. https://doi.org/10.1080/00207543.2017.1285077
O’Donovan R, Uzsoy R, McKay KN (1999) Predictable scheduling of a single machine with breakdowns and sensitive jobs. Int J Prod Res 37:4217–4233
Zhu H, Zhou H (2014) Single machine predictive scheduling using inserted idle times. J Appl Math 2014:1–5
Liu Q, Ullah S, Zhang C (2011) An improved genetic algorithm for robust permutation flowshop scheduling. Int J Adv Manuf Technol 56:345–354. https://doi.org/10.1007/s00170-010-3149-6
Wang K, Choi SH, Qin H (2014) An estimation of distribution algorithm for hybrid flow shop scheduling under stochastic processing times. Int J Prod Res 52:7360–7376. https://doi.org/10.1080/00207543.2014.930535
Moratori P, Petrovic S, Vázquez A (2008) Match-up strategies for job shop rescheduling. In: New frontiers in applied artificial intelligence, Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, pp 119–128
Moratori P, Petrovic S, Vázquez-Rodríguez JA (2012) Match-up approaches to a dynamic rescheduling problem. Int J Prod Res 50:261–276
Zakaria Z, Petrovic S (2012) Genetic algorithms for match-up rescheduling of the flexible manufacturing systems. Comput Ind Eng 62:670–686. https://doi.org/10.1016/j.cie.2011.12.001
Zhang L, Gao L, Li X (2012) A hybrid intelligent algorithm and rescheduling technique for job shop scheduling problems with disruptions. Int J Adv Manuf Technol 65:1141–1156. https://doi.org/10.1007/s00170-012-4245-6
Wang DJ, Liu F, Wang JJ, Wang YZ (2016) Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization. Soft Comput 20:1635–1652. https://doi.org/10.1007/s00500-015-1615-7
Pan QK, Ruiz R (2014) An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem. Omega 44:41–50. https://doi.org/10.1016/j.omega.2013.10.002
Lin SW, Ying KC, Huang CY (2013) Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. Int J Prod Res 51:5029–5038. https://doi.org/10.1080/00207543.2013.790571
Ribas I, Companys R, Tort-Martorell X (2011) An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega 39:293–301. https://doi.org/10.1016/j.omega.2010.07.007
Fatih Tasgetiren M, Pan QK, Suganthan PN, Buyukdagli O (2013) A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput Oper Res 40:1729–1743. https://doi.org/10.1016/j.cor.2013.01.005
Ding JY, Song S, Gupta JND, Zhang R, Chiong R, Wu C (2015) An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Appl Soft Comput J 30:604–613. https://doi.org/10.1016/j.asoc.2015.02.006
Pan QK, Wang L, Zhao BH (2008) An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int J Adv Manuf Technol 38:778–786. https://doi.org/10.1007/s00170-007-1120-y
Ruiz R, Stützle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187:1143–1159. https://doi.org/10.1016/j.ejor.2006.07.029
García-Martínez C, Rodriguez FJ, Lozano M (2014) Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem. Eur J Oper Res 232:454–463. https://doi.org/10.1016/j.ejor.2013.07.035
Rodriguez FJ, Lozano M, Blum C, García-Martínez C (2013) An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem. Comput Oper Res 40:1829–1841. https://doi.org/10.1016/j.cor.2013.01.018
Deng G, Gu X (2012) An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Int J Syst Sci 45:351–362. https://doi.org/10.1080/00207721.2012.723054
Fanjul-Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207:55–69. https://doi.org/10.1016/j.ejor.2010.03.030
Congram RK, Potts CN, De VV, Steef L (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J Comput 14:52–67. https://doi.org/10.1287/ijoc.14.1.52.7712
Michalewicz Z, Nazhiyath G (1995) Genocop III: a co-evolutionary algorithm for numerical optimization problems with nonlinear constraints. Evol Comput 1995IEEE Int Conf 2:647–651. https://doi.org/10.1109/ICEC.1995.487460
Xiao J, Michalewicz Z, Zhang L, Trojanowski K (1997) Adaptive evolutionary planner/navigator for mobile robots. IEEE Trans Evol Comput 1:18–28. https://doi.org/10.1109/4235.585889
Mühlenbein H (1992) Parallel genetic algorithms in combinatorial optimization. Comput Sci Oper Res:441–456
Liepins GE, Vose MD (1990) Representational issues in genetic optimization. J Exp Theor Artif Intell 2:101–115. https://doi.org/10.1080/09528139008953717
Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold Company
Orvosh D, Davis L (1994) Using a genetic algorithm to optimize problems with feasibility constraints. Proc First IEEE Conf Evol Comput:548–553
Coello Coello CA (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191:1245–1287. https://doi.org/10.1016/S0045-7825(01)00323-1
Chootinan P, Chen A (2006) Constraint handling in genetic algorithms using a gradient-based repair method. Comput Oper Res 33:2263–2281
Ying KC, Cheng HM (2010) Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic. Expert Syst Appl 37:2848–2852. https://doi.org/10.1016/j.eswa.2009.09.006
Pranzo M, Pacciarelli D (2016) An iterated greedy metaheuristic for the blocking job shop scheduling problem. J Heuristics 22:587–611. https://doi.org/10.1007/s10732-014-9279-5
Appa G, Pitsoulis L, Williams HP (2006) Handbook on modelling for discrete optimization. Springer, US
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326
Nawaz M, Enscore Jr. EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11:91–95
Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65–74. https://doi.org/10.1016/0377-2217(90)90090-X
Vallada E, Ruiz R, Framinan JM (2015) New hard benchmark for flowshop scheduling problems minimising makespan. Eur J Oper Res 240:666–677
Ruiz R, Allahverdi A (2009) Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. Comput Oper Res 36:1268–1283. https://doi.org/10.1016/j.cor.2007.12.013
Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278–285
Taillard E Summary of best known lower and upper bounds of Taillard’s instances. http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/flowshop.dir/best_lb_up.txt. Accessed 22 May 2015
Funding
The Ph.D. scholarship supported by the Queen’s University Belfast, UK and China Scholarship Council (201306050018) is acknowledged.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Liu, W., Jin, Y. & Price, M. New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival. Int J Adv Manuf Technol 98, 1817–1830 (2018). https://doi.org/10.1007/s00170-018-2171-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-018-2171-y