Skip to main content
SpringerLink
Log in

Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we investigate new lower bounds for the P|r j ,q j |C max scheduling problem. A new bin packing based lower bound, as well as several new lifting procedures are derived for this strongly NP -hard problem. Extensive numerical experiments show that the proposed lower bounds consistently outperform the best existing ones.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Blocher, J.D. and S. Chand. (1991). “Scheduling of Parallel Processors: A Posteriori Bound on LPT Sequencing and a Two-Step Algorithm.” Naval Research Logistics 38, 273–287.

    Google Scholar 

  • Carlier, J. (1982). “The One Machine Sequencing Problem.” European Journal of Operational Research 11, 42–47.

    Google Scholar 

  • Carlier, J. (1987). “Scheduling Jobs with Release Dates and Tails on Identical Machines to Minimize the Makespan.” European Journal of Operational Research 29, 298–306.

    Google Scholar 

  • Carlier, J. and B. Latapie. (1991). “Une méthode arborescente pour résoudre les problèmes cumulatifs.” RAIRO 25, 311–340.

    Google Scholar 

  • Carlier, J. and E. Pinson. (1998). “Jackson's Pseudo Preemptive Schedule for the Pm/rj, qj /Cmax Scheduling Problem.” Annals of Operations Research 83, 41–58.

    Google Scholar 

  • Dell'Amico, M. and S. Martello. (1995). “Optimal Scheduling of Tasks on Identical Parallel Processors.” ORSA Journal on Computing 7, 191–200.

    Google Scholar 

  • Garey, M.R. and D.S. Johnson. (1978). “Strong NP-Completeness Results: Motivation, Examples and Implications.” Journal of the Association of Computer Machinery 25, 499–508.

    Google Scholar 

  • Gharbi, A. and M. Haouari. (2002). “Minimizing Makespan on Parallel Machines Subject to Release Dates and Delivery Times.” Journal of Scheduling 5, 329–355.

    Google Scholar 

  • Hoogeveen, H., C. Hurkens, J.K. Lenstra, and A. Vandevelde. (1995). “Lower Bounds for the Multiprocessor Flow Shop.” In Second Workshop on Models and Algorithms for Planning and Scheduling. Wernigerode.

  • Horn, W.A. (1974). “Some Simple Scheduling Algorithms.” Naval Research Logistics Quarterly 21, 177–185.

    Google Scholar 

  • Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D. Shmoys. (1993). “Sequencing and Scheduling: Algorithms and Complexity.” In S.C. Graves et al. (eds.), Handbooks in Operations Research and Management Science, Vol. 4, pp. 445–522. North-Holland.

  • Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley.

  • Perregaard, M. (1995). “Branch and Bound Method for the Multiprocessor Jobshop and Flowshop Scheduling Problem.” Master Thesis, Datalogisk Institut Københavns Universitet.

  • Schmidt, G. (2000). “Scheduling with Limited Machine Availability.” European Journal of Operational Research 121, 1–15.

    Google Scholar 

  • Vandevelde, A. (1994). “Minimizing the Makespan in a Multiprocessor Flowshop.” Master Thesis, Eindhoven University of Technology.

Download references

Author information

Authors and Affiliations

  1. Laboratory of Mathematical Engineering, Ecole Polytechnique de Tunisie, BP 743, 2078, La Marsa, Tunisia

    Mohamed Haouari & Anis Gharbi

Authors
  1. Mohamed Haouari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anis Gharbi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Haouari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haouari, M., Gharbi, A. Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails. Annals of Operations Research 129, 187–204 (2004). https://doi.org/10.1023/B:ANOR.0000030688.31785.40

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:ANOR.0000030688.31785.40

Search

Navigation