A heuristic algorithm for master planning that satisfies multiple objectives
Computers and Operations Research
Distributed search for supply chain coordination
Computers in Industry
Dynamic supply chain scheduling
Journal of Scheduling
Hi-index | 0.00 |
One of the main issues on task planning of the enterprises with several production sites is how they can reassign tasks when a part of the supply chain is stopped. In this case, a good re-schedule, involving parts from supply chains from other sites, could imply to reduce overall costs. In this paper, we propose a cooperative system to re-schedule a network chain. The algorithm proposed is described and analyzed analytically in detail. The reschedule decision is taken based on the time and the cost reduction. In order to test its performance and the success of our proposal, we have simulated a stylized system based on an engine network chain using the Anylogic TM simulator. Our proposal allows cooperative multisite re-scheduling by selecting the type of transport for sending components from one site to another based on the costs and the deadline to assemble the final product.