EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1302. An Iterated Greedy Search Procedure for the Distributed Flow Shop Scheduling Problem With Inter-Factory Transportation
Invited abstract in session WD-60: Flow shop and single machine scheduling , stream Project Management and Scheduling.
Wednesday, 14:30-16:00Room: S09 (building: 101)
Authors (first author is the speaker)
| 1. | Tristan Becker
|
| TU Dresden | |
| 2. | Janis Sebastian Neufeld
|
| Operations Management, Otto von Guericke University Magdeburg | |
| 3. | Udo Buscher
|
| Industrial Management, TU Dresden |
Abstract
Large industrial corporations typically operate a network of several factories, leading to a distributed flow shop scheduling problem for flowline manufacturing processes. This requires assigning jobs to one of multiple distributed factories, each equipped with identical flow shops, where each job must be completed in their designated factory. Our research builds upon the traditional distributed flow shop scheduling problem by including the transport of intermediate goods between factories. This transport can occur after each machine operation, with the transportation times varying based on the distance between the origin and destination factories. The objective is to minimize the maximum makespan across all factories. We propose an iterated greedy search algorithm for the distributed flow shop scheduling problem with inter-factory transportation. Utilizing a graph representation, we have developed a speed-up technique to enhance the search efficiency of the algorithm. Through computational experiments, we demonstrate the efficacy and efficiency of our proposed algorithm. Finally, our research quantifies the value of introducing the possibility of inter-factory transportation. While transportation can potentially delay processing at subsequent machine stages, our findings suggest that this is outweighed by improved machine utilization across factories. Therefore, we observe an enhanced overall efficiency and reduced makespans.
Keywords
- Scheduling
- Manufacturing
- Metaheuristics
Status: accepted
Back to the list of papers