Modeling and heuristics for scheduling of distributed job shops

This paper deals with the problem of distributed job shop scheduling in which the classical single-facility job shop is extended to the multi-facility one. The mathematical formulation of the problem is comprehensively discussed. Two different mixed integer linear programming models in form of sequence and position based variables are proposed. Using commercial software of CPLEX, the small sized problems are optimally solved. To solve large sized problems, besides adapting three well-known heuristics, three greedy heuristics are developed. The basic idea behind the developed heuristics is to iteratively insert operations (one at each iteration) into a sequence to build up a complete permutation of operations. The permutation scheme, although having several advantages, suffers from redundancy which is having many different permutations representing the same schedule. The issue is analyzed to recognize the redundant permutation. That improves efficiency of heuristics. Comprehensive experiments are conducted to evaluate the performance of the two models and the six heuristics. The results show sequence based model and greedy heuristics equipped with redundancy exclusion are effective for the problem.

[1]  Rubén Ruiz,et al.  The distributed permutation flowshop scheduling problem , 2010, Comput. Oper. Res..

[2]  Ling Wang,et al.  An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem , 2013 .

[3]  Andrew Y. C. Nee,et al.  Web-based Multi-functional Scheduling System for a Distributed Manufacturing Environment , 2002, Concurr. Eng. Res. Appl..

[4]  Jian Gao,et al.  An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem , 2013 .

[5]  Lihui Wang,et al.  Process planning and scheduling for distributed manufacturing , 2007 .

[6]  Ping Chen,et al.  An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..

[7]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[8]  Fan T. Tseng,et al.  Two models for a family of flowshop sequencing problems , 2002, Eur. J. Oper. Res..

[9]  Amir Masoud Rahmani,et al.  Solving Distributed Flexible Manufacturing Systems Scheduling Problems Subject to Maintenance: Memetic Algorithms Approach , 2009, 2009 Ninth IEEE International Conference on Computer and Information Technology.

[10]  Rong Chen,et al.  An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems , 2011 .

[11]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[12]  Shih-Wei Lin,et al.  Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm , 2013 .

[13]  Liang Gao,et al.  A Discrete Electromagnetism-Like Mechanism Algorithm for Solving Distributed Permutation Flowshop Scheduling Problem , 2010, 2010 International Conference on Manufacturing Automation.

[14]  Andrew Y. C. Nee,et al.  Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems , 2007, Comput. Ind. Eng..

[15]  Chao-Hsien Pan,et al.  A study of integer programming formulations for scheduling problems , 1997, Int. J. Syst. Sci..

[16]  Manoj Kumar Tiwari,et al.  Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach , 2006 .

[17]  Rubén Ruiz,et al.  New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .

[18]  Rong Chen,et al.  A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem , 2011, Int. J. Comput. Intell. Syst..

[19]  Andrew Y. C. Nee,et al.  A modified genetic algorithm for distributed scheduling problems , 2003, J. Intell. Manuf..

[20]  Sai Ho Chung,et al.  An adaptive genetic algorithm with dominated genes for distributed scheduling problems , 2005, Expert Syst. Appl..

[21]  Seyyed M. T. Fatemi Ghomi,et al.  The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine , 2013, Inf. Sci..

[22]  Rong Chen,et al.  A Knowledge-based Genetic Algorithm for Permutation Flowshop Scheduling Problems with Multiple Factories , 2012 .