Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carlier, J., Moukrim, A., Xu, H.: The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm. Discrete Applied Mathematics 157(17), 3631–3642 (2009)
Slowinski, R.: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. European Journal of Operational Research 15, 366–373 (1984)
Gafarov, E.R., Lazarev, A.A.: Single machine scheduling with a non-renewable financial resource. Working paper (2010)
Baoqiang, F.: Scheduling with fixed delivery dates and temporary storage. In: International Conference on Logistics Systems and Intelligent Management, China, pp. 1926–1929 (2010)
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)
Yalaoui, F., Chu, C.: A new exact method to solve the Pm/ri/∑ci schedule problem. International Journal of Production Economics 100(1), 168–179 (2006)
Cochand, M., de Werra, D., Slowinski, R.: Preemptive scheduling with staircase and piecewise linear resource availability. Methods and Models of Operations Research 33, 297–313 (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belkaid, F., Maliki, F., Boudahri, F., Sari, Z. (2012). A Branch and Bound Algorithm to Minimize Makespan on Identical Parallel Machines with Consumable Resources. In: Jin, D., Lin, S. (eds) Advances in Mechanical and Electronic Engineering. Lecture Notes in Electrical Engineering, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31507-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-31507-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31506-0
Online ISBN: 978-3-642-31507-7
eBook Packages: EngineeringEngineering (R0)