Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chan FTS, Chung SH, Chan LY, Finke G, Tiwari MK (2006) Solving distributed FMS scheduling problems subject to maintenance: genetic algorithms approach. Robot Comput-Integr Manuf 22:493–504
Rosenau MD (1996) The PDMA handbook of new product development. Wiley, New York
Wang B (1997) Integrated product, process and enterprise design. Chapman & Hall, London
Jia HZ, Fuh JYH, Nee AYC, Zhang YF (2003) A modified genetic algorithm for distributed scheduling problems. J Intell Manuf 15:351–362
Giovanni LD, Pezzella F (2010) An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur J Oper Res 200:395–408
Wang L, Shen W (eds) (2007) Process planning and scheduling for distributed manufacturing. Springer, London
Baker K (1974) Introduction to sequencing and scheduling. Wiley, NewYork
Pinedo M (2002) Scheduling: theory, algorithms and systems. Prentice-Hall, Englewood Cliffs
Garey MR, Johnson DS, Sethi R (1976) The complexity of flow shop and job-shop scheduling. Math Oper Res 1(2):117–129
Wang S-Y, Wang L, Liu M, Xu Y (2013) An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int J Prod Econ (in press)
Gao J, Chen R, Deng W (2013) An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 51(3):641–651
Jia HZ, Fuh JYH, Nee AYC, Zheng YF (2002) Web-based multi-functional scheduling system for a distributed manufacturing environment. Concurr Eng Res Appl 10(1):27–39
Chan FTS, Chung SH, Chan PLY (2005) An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Syst Appl 29:364–371
Chan FTS, Chung SH, Chan PLY (2006) Application of genetic algorithms with dominated genes in a distributed scheduling problem in flexible manufacturing. Int J Prod Res 44(3):523–543
Dell’Amico M, Trubian M (1993) Applying tabu-search to the job-shop scheduling problem. Ann Oper Res 4:231–252
Matsuo H, Suh C, Sullivan R (1988) A controlled search simulated annealing method for the general job-shop scheduling problem. Tech rep 03-04-88, Department of Management, The University of Texas, Austin
Van Laarhoven P, Aarts E, Lenstra J (1992) Job shop scheduling by simulated annealing. Oper Res 40:113–125
Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ziaee, M. A heuristic algorithm for the distributed and flexible job-shop scheduling problem. J Supercomput 67, 69–83 (2014). https://doi.org/10.1007/s11227-013-0986-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-013-0986-8