A Branch and Bound Algorithm to Minimize Makespan on Identical Parallel Machines with Consumable Resources
In this paper, we study a scheduling problem for minimizing the makespan on identical parallel machines with consumable resources in a node of a supply chain. The goal is to provide a first exact approach to this problem through the use of Branch and Bound method. We propose two new heuristics and apply other with a series of lower bounds that are incorporated into our algorithm. We tested a large number of randomly generated instances that allow us to compare the computation time and quality of lower bounds and heuristics.
KeywordsScheduling Makespan Parallel Machines Branch and Bound
Unable to display preview. Download preview PDF.
- 3.Gafarov, E.R., Lazarev, A.A.: Single machine scheduling with a non-renewable financial resource. Working paper (2010)Google Scholar
- 4.Baoqiang, F.: Scheduling with fixed delivery dates and temporary storage. In: International Conference on Logistics Systems and Intelligent Management, China, pp. 1926–1929 (2010)Google Scholar
- 5.Carrera, S., Portmann, M.C., Ramdane Cherif, W.: Scheduling supply chain node with fixed components arrivals and two partially flexible deliveries. In: 5th International Conference on Management and Control of Production and Logistics, France (2010)Google Scholar