A Branch and Bound Algorithm to Minimize Makespan on Identical Parallel Machines with Consumable Resources

  • Fayçal Belkaid
  • Fouad Maliki
  • Fethi Boudahri
  • Zaki Sari
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 176)

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.

Keywords

Scheduling Makespan Parallel Machines Branch and Bound 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Slowinski, R.: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. European Journal of Operational Research 15, 366–373 (1984)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Gafarov, E.R., Lazarev, A.A.: Single machine scheduling with a non-renewable financial resource. Working paper (2010)Google Scholar
  4. 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. 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
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Fayçal Belkaid
    • 1
  • Fouad Maliki
    • 1
  • Fethi Boudahri
    • 1
  • Zaki Sari
    • 1
  1. 1.Manufacturing Engineering Laboratory of TlemcenAbou Bekr Belkaid UniversityTlemcenAlgéria

Personalised recommendations