A heuristic algorithm for the distributed and flexible job-shop scheduling problem

The distributed manufacturing takes place in a multi-factory environment including several factories, which may be geographically distributed in different locations, or in a multi-cell environment including several independent manufacturing cells located in the same plant. Each factory/cell is capable of manufacturing a variety of product types. An important issue in dealing with the production in this decentralized manner is the scheduling of manufacturing operations of products (jobs) in the distributed manufacturing system. In this paper, we study the distributed and flexible job-shop scheduling problem (DFJSP) which involves the scheduling of jobs (products) in a distributed manufacturing environment, under the assumption that the shop floor of each factory/cell is configured as a flexible job shop. A fast heuristic algorithm based on a constructive procedure is developed to obtain good quality schedules very quickly. The algorithm is tested on benchmark instances from the literature in order to evaluate its performance. Computational results show that, despite its simplicity, the proposed heuristic is computationally efficient and promising for practical problems.

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

[2]  Kenneth B. Kahn.  The PDMA Handbook of New Product Development , 1996 .

[3]  Felix T.S. Chan,et al.  Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems , 2006 .

[4]  Lihui Wang,et al.  Process Planning and Scheduling for Distributed Manufacturing (Springer Series in Advanced Manufacturing) , 2007 .

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

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

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

[8]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

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

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

[11]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[12]  Ferdinando Pezzella,et al.  An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem , 2010, Eur. J. Oper. Res..

[13]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[14]  Ben Wang,et al.  Integrated Product, Process and Enterprise Design , 1997 .

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

[16]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[17]  Valeria Vittorini,et al.  Modeling and logic controller specification of flexible manufacturing systems using behavioral traces and Petri net building blocks , 2004, J. Intell. Manuf..

[18]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..