An Effective Harmony Search Algorithm for Solving a No-Wait Hybrid Flow Shop Scheduling Problem with Machine Availability Constraint

This research investigates a no-wait hybrid flow shop scheduling problem. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. Characteristics of our considered problem leads to the complexity of problem. First, no-wait operations. Second, setup time of each job is separated from its processing time and depends upon its preceding job. Third, all of jobs aren’t available at the first of scheduling. In other word, each job has individual ready time. Finally, machines are not continuously available due to the preventive maintenance. An effective harmony search algorithm is used to tackle the mentioned problem. A series of computational experiments is conducted by comparing our algorithm with previous meta-heuristic algorithms like population based simulated annealing (PBSA), Adopted imperialist competitive algorithm (ICA) and hybridization of PBSA and ICA (ICA+PBSA). To achieve reliable results, Taguchi approach is used to define robust parameters’ values for our proposed algorithm. The computational results with random test problems suggest that our proposed harmony search outperforms the three foregoing algorithms.

[1]  Joshua D. Knowles,et al.  Local Search, Multiobjective Optimization and the Pareto Archived Evolution Strategy , 1999 .

[2]  Fariborz Jolai,et al.  A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times , 2012 .

[3]  Ling Wang,et al.  A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation , 2014 .

[4]  Chelliah Sriskandarajah,et al.  A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups , 2000, Oper. Res. Lett..

[5]  Pei-Chann Chang,et al.  Scheduling of drilling operations in printed circuit board factory , 2003 .

[6]  Mostafa Zandieh,et al.  An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times , 2011, J. Intell. Manuf..

[7]  Andrei Tchernykh,et al.  Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers , 2009, Comput. Ind. Eng..

[8]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[9]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives , 2016, J. Intell. Manuf..

[10]  Byung Soo Kim,et al.  Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability , 2015, Comput. Ind. Eng..

[11]  Mitsuo Gen,et al.  A genetic algorithm approach to the bi-criteria allocation of customers to warehouses , 2003 .

[12]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[13]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..

[14]  Marcelo Seido Nagano,et al.  A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times , 2015 .

[15]  C. Balamurugan,et al.  Simultaneous optimal selection of design and manufacturing tolerances with alternative manufacturing process selection , 2011, Comput. Aided Des..

[16]  R. Shafaei,et al.  An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines , 2014 .

[17]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[18]  Dechang Pi,et al.  A hybrid discrete optimization algorithm based on teaching-probabilistic learning mechanism for no-wait flow shop scheduling , 2016, Knowl. Based Syst..

[19]  Chelliah Sriskandarajah,et al.  One-operator-two-machine flowshop scheduling with setup and dismounting times , 1999, Comput. Oper. Res..

[20]  F. Jolai,et al.  A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem , 2014, The International Journal of Advanced Manufacturing Technology.

[21]  Damiano Pasini,et al.  A non-dominated sorting hybrid algorithm for multi-objective optimization of engineering problems , 2011 .

[22]  Fariborz Jolai,et al.  A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection , 2009 .

[23]  M. K. Marichelvam,et al.  Application of novel harmony search algorithm for solving hybrid flow shop scheduling problems to minimise makespan , 2016 .

[24]  Mehmet Fatih Tasgetiren,et al.  A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[25]  Rong-Hwa Huang,et al.  No-wait two-stage multiprocessor flow shop scheduling with unit setup , 2009 .

[26]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective , 2003 .

[27]  R. Tavakkoli-Moghaddam,et al.  A multi-objective scatter search for a bi-criteria no-wait flow shop scheduling problem , 2008 .

[28]  Majid Khalili,et al.  Multi-objective no-wait hybrid flowshop scheduling problem with transportation times , 2012, Int. J. Comput. Sci. Eng..

[29]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[30]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[31]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[32]  Tarek Y. ElMekkawy,et al.  An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server , 2011 .

[33]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[34]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[35]  Jinxing Xie,et al.  Minimum deviation algorithm for two-stageno-wait flowshops with parallel machines , 2004 .

[36]  Shanlin Yang,et al.  Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types , 2016, Annals of Mathematics and Artificial Intelligence.

[37]  T. R. Bement,et al.  Taguchi techniques for quality engineering , 1995 .

[38]  Shih-Wei Lin,et al.  Minimizing makespan for solving the distributed no-wait flowshop scheduling problem , 2016, Comput. Ind. Eng..

[39]  Mostafa Zandieh,et al.  Scheduling of a no-wait two-machine flow shop with sequence-dependent setup times and probable rework using robust meta-heuristics , 2012 .

[40]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[41]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[42]  Jatinder N. D. Gupta,et al.  Two-stage no-wait scheduling models with setup and removal times separated , 1997, Comput. Oper. Res..

[43]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[44]  Han Hoogeveen,et al.  Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing , 2000, Eur. J. Oper. Res..

[45]  Jinxing Xie,et al.  A heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage , 2012 .

[46]  Mostafa Zandieh,et al.  Group scheduling in hybrid flexible flowshop with sequence-dependent setup times and random breakdowns via integrating genetic algorithm and simulation , 2015 .

[47]  Nasser Salmasi,et al.  Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem , 2013, Comput. Ind. Eng..

[48]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

[49]  Seyyed M. T. Fatemi Ghomi,et al.  A high performing metaheuristic for job shop scheduling with sequence-dependent setup times , 2010, Appl. Soft Comput..

[50]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[51]  A. Allahverdi,et al.  New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness , 2009 .

[52]  Marcelo Seido Nagano,et al.  New heuristics for the no-wait flowshop with sequence-dependent setup times problem , 2015 .

[53]  Ali Allahverdi,et al.  Total completion time with makespan constraint in no-wait flowshops with setup times , 2014, Eur. J. Oper. Res..

[54]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[55]  Mostafa Zandieh,et al.  A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic , 2009, Expert Syst. Appl..

[56]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[57]  Rasoul Shafaei,et al.  An adaptive neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop , 2011, Int. J. Comput. Integr. Manuf..

[58]  Shiv Prasad Yadav,et al.  Interactive fuzzy multiobjective reliability optimization using NSGA-II , 2009 .

[59]  William G. Cochran,et al.  Experimental designs, 2nd ed. , 1957 .

[60]  Mostafa Zandieh,et al.  Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches , 2012 .

[61]  Ching-Fang Liaw.  A branch-and-bound algorithm for identical parallel machine total tardiness scheduling problem with preemption , 2016 .

[62]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[63]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[64]  Tarek Y. ElMekkawy,et al.  Solving the no-wait flow-shop problem with sequence-dependent set-up times , 2014, Int. J. Comput. Integr. Manuf..

[65]  Xiaoping Li,et al.  Heuristic for no-wait flow shops with makespan minimization , 2008, ICIT 2008.

[66]  Bahman Naderi,et al.  A bi-objective imperialist competitive algorithm for no-wait flexible flow lines with sequence dependent setup times , 2015 .

[67]  E. Shokrollahpour,et al.  A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem , 2011 .

[68]  Zong Woo Geem,et al.  Harmony Search Optimization: Application to Pipe Network Design , 2002 .

[69]  Ali Allahverdi,et al.  No-wait flowshops with bicriteria of makespan and maximum lateness , 2004, Eur. J. Oper. Res..

[70]  Chinyao Low,et al.  Unrelated parallel-machine scheduling with controllable processing times and eligibility constraints to minimize the makespan , 2016 .

[71]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[72]  Silvia Curteanu,et al.  An elitist non-dominated sorting genetic algorithm enhanced with a neural network applied to the multi-objective optimization of a polysiloxane synthesis process , 2011, Eng. Appl. Artif. Intell..

[73]  Mariappan Kadarkarainadar Marichelvam,et al.  Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time , 2017, Appl. Soft Comput..

[74]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[75]  Fariborz Jolai,et al.  No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach , 2015, J. Intell. Manuf..

[76]  John W. Fowler,et al.  Scheduling of unrelated parallel machines: an application to PWB manufacturing , 2002 .

[77]  Amir Hossein Gandomi,et al.  Hybridizing harmony search algorithm with cuckoo search for global numerical optimization , 2014, Soft Computing.

[78]  Malgorzata Sterna,et al.  Two-machine flow-shop scheduling to minimize total late work: revisited , 2018, Engineering Optimization.

[79]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[80]  Mohamed Haouari,et al.  On the hybrid flowshop scheduling problem , 2008 .

[81]  Mostafa Zandieh,et al.  Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism , 2011 .

[82]  Ivo F. Sbalzariniy,et al.  Multiobjective optimization using evolutionary algorithms , 2000 .

[83]  Rubén Ruiz,et al.  A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..

[84]  Rasoul Shafaei,et al.  No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms , 2013, J. Exp. Theor. Artif. Intell..

[85]  Majid Khalili,et al.  A multi-objective electromagnetism algorithm for a bi-objective hybrid no-wait flowshop scheduling problem , 2014 .

[86]  Reza Sadeghi Rad,et al.  An intelligent hybrid metaheuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines , 2014 .

[87]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems , 2009, Comput. Oper. Res..

[88]  Chelliah Sriskandarajah,et al.  Some no-wait shops scheduling problems: Complexity aspect , 1986 .

[89]  Nidhal Rezg,et al.  No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates , 2011 .

[90]  Reza Tavakkoli-Moghaddam,et al.  A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness , 2007, Inf. Sci..

[91]  B. M. T. Lin,et al.  Two-machine flow-shop scheduling to minimize total late work , 2006 .

[92]  Marcelo Seido Nagano,et al.  Evaluating the performance for makespan minimisation in no-wait flowshop sequencing , 2008 .

[93]  Frank Werner,et al.  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2009, Comput. Oper. Res..

[94]  Mostafa Zandieh,et al.  A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties , 2011, Expert Syst. Appl..

[95]  Vahid Riahi,et al.  A new hybrid ant colony algorithm for scheduling of no-wait flowshop , 2018, Oper. Res..

[96]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[97]  Leyuan Shi,et al.  A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing , 2017 .

[98]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[99]  Rubén Ruiz,et al.  Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources , 2017, Eur. J. Oper. Res..

[100]  T. C. Edwin Cheng,et al.  Single-machine scheduling with time-dependent and position-dependent deteriorating jobs , 2015, Int. J. Comput. Integr. Manuf..

[101]  Dunwei Gong,et al.  A Heuristic Genetic Algorithm for No-Wait Flowshop Scheduling Problem , 2007 .

[102]  Rasaratnam Logendran,et al.  Bi-criteria group scheduling in hybrid flowshops , 2013 .

[103]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[104]  Tariq A. Aldowaisan.  A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..

[105]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[106]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[107]  Bahman Naderi,et al.  Hybrid flexible flowshop problems: Models and solution methods , 2014 .