Exact and Heuristic Procedures for the Two-Center Hybrid Flow Shop Scheduling Problem With Transportation Times

This paper addresses the two centers hybrid flow shop scheduling problem with transportation times. This problem is faced in several real-world applications. The considered objective function to be minimized in this problem is the maximum completion time. This scheduling problem is NP-hard, and most presented research in this scheduling area ignore the transportation times. In order to solve the considered scheduling problem, several lower bounds are developed. In addition, a two phase’s heuristic is presented. This heuristic is based on the optimal solution of the parallel machine scheduling problem with release date and delivery time. Furthermore, a branch and bound exact procedure is developed. Finally, extensive numerical experiments are presented in order to asses the performance and the effectiveness of the proposed procedures. Computational results provide evidence that the proposed procedures are very effective in term of producing optimal solutions in a short computational time for large size problems.

[1]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[2]  J. Gupta,et al.  Scheduling a two-stage hybrid flowshop with separable setup and removal times , 1994 .

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

[4]  Wei Xing Zheng,et al.  Synchronization and State Estimation of a Class of Hierarchical Hybrid Neural Networks With Time-Varying Delays , 2016, IEEE Transactions on Neural Networks and Learning Systems.

[5]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[6]  George L. Vairaktarakis,et al.  Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..

[7]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .

[8]  Wei-ya Zhong,et al.  Hybrid Flowshop Scheduling with Interstage Job Transportation , 2014 .

[9]  Lotfi Hidri,et al.  New Efficient Lower Bound for the Hybrid Flow Shop Scheduling Problem With Multiprocessor Tasks , 2017, IEEE Access.

[10]  Wei Xing Zheng,et al.  HMM-Based $\mathcal{H}_{\infty}$ Filtering for Discrete-Time Markov Jump LPV Systems Over Unreliable Communication Channels , 2018, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[11]  Seetuarma L. Narastmhan,et al.  Scheduling in a two-stage manufacturing process , 1984 .

[12]  Mostafa Zandieh,et al.  An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness , 2009, Expert Syst. Appl..

[13]  Atabak Elmi,et al.  A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots , 2013, Comput. Oper. Res..

[14]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[15]  Abdelghani Bekrar,et al.  A two-stage flow shop scheduling problem with transportation considerations , 2015, 4OR.

[16]  Parviz Fattahi,et al.  An immune algorithm for hybrid flow shop scheduling problem with time lags and sequence-dependent setup times , 2012, The International Journal of Advanced Manufacturing Technology.

[17]  Maria Leonilde Rocha Varela,et al.  Comparative Simulation Study of Production Scheduling in the Hybrid and the Parallel Flow , 2017 .

[18]  Salah E. Elmaghraby,et al.  SCHEDULING HYBRID FLOWSHOPS IN PRINTED CIRCUIT BOARD ASSEMBLY LINES , 2009 .

[19]  Javad Rezaeian,et al.  Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time , 2016, Appl. Soft Comput..

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

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

[22]  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..

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

[24]  Mostafa Zandieh,et al.  Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization , 2009, Comput. Ind. Eng..

[25]  Mohamed Haouari,et al.  Minimizing makespan on parallel machines subject to release dates and delivery times , 2002 .

[26]  Hongli Zhu,et al.  A two stage scheduling with transportation and batching , 2012, Inf. Process. Lett..

[27]  Mohamed Haouari,et al.  Optimal Scheduling of a Two-stage Hybrid Flow Shop , 2006, Math. Methods Oper. Res..

[28]  S. E. Elmaghraby,et al.  Production control in hybrid flowshops: an example from textile manufacturing , 1997 .

[29]  Mohamed Haouari,et al.  Optimal parallel machines scheduling with availability constraints , 2005, Discret. Appl. Math..

[30]  Mohamed Haouari,et al.  Heuristic algorithms for the two-stage hybrid flowshop problem , 1997, Oper. Res. Lett..