Job shop scheduling by simulated annealing
Operations Research
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
Process Planning and Scheduling for Distributed Manufacturing (Springer Series in Advanced Manufacturing)
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
An adaptive genetic algorithm with dominated genes for distributed scheduling problems
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
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.