Minimizing makespan in hybrid flow shop scheduling with multiprocessor task problems using a discrete harmony search

The hybrid flow shop scheduling with multiprocessor task (HFSMT) is one of extremely difficult problems in combinatorial optimization. The problem finds various applications in manufacturing and industrial systems such as, manufacturing textile and electronics industries. In this paper, a discrete harmony search algorithm is proposed to solve the HFSMT problem with the objective to minimize the makespan. Computational experiments are carried out based on well-known benchmarks. The obtained results and the comparisons show the effectiveness of the proposed algorithm.

[1]  Mohamed Haouari,et al.  Improved bounds for hybrid flow shop scheduling with multiprocessor tasks , 2013, Comput. Ind. Eng..

[2]  Funda Sivrikaya-Serifoglu,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..

[3]  Kadir Buyukozkan,et al.  A harmony search algorithm for hybrid flow shop scheduling with multiprocessor task problems , 2015, 2015 6th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO).

[4]  Ceyda Oguz,et al.  Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..

[5]  Zong Woo Geem,et al.  Application of Harmony Search to Vehicle Routing , 2005 .

[6]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

[7]  Cengiz Kahraman,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach , 2010, Appl. Soft Comput..

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

[9]  Shih-Wei Lin,et al.  Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning , 2013, Comput. Oper. Res..

[10]  Fuh-Der Chou,et al.  PARTICLE SWARM OPTIMIZATION WITH COCKTAIL DECODING METHOD FOR HYBRID FLOW SHOP SCHEDULING PROBLEMS WITH MULTIPROCESSOR TASKS , 2013 .

[11]  Rezaeian Javad,et al.  SCHEDULING OF A HYBRID FLOW SHOP WITH MULTIPROCESSOR TASKS BY A HYBRID APPROACH BASED ON GENETIC AND IMPERIALIST COMPETITIVE ALGORITHMS , 2013 .

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

[13]  Ahmed Azab,et al.  Machine scheduling for multitask machining , 2018 .

[14]  Ceyda Oguz,et al.  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks , 2005, J. Sched..

[15]  Orhan Engin,et al.  An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems , 2011, Appl. Soft Comput..