Measuring the slack between lower bounds for scheduling on parallel machines

Jacques Carlier () and Claire Hanen ()
Additional contact information
Jacques Carlier: UTC, Heudiasyc
Claire Hanen: Sorbonne Université, CNRS, LIP6

Annals of Operations Research, 2024, vol. 338, issue 1, No 13, 347-377

Abstract: Abstract This paper considers the problem of scheduling independent jobs with release dates and tails on m identical machines to minimize the makespan. The three main bounds are the preemptive bound, the energetic bound and the Jackson Pseudo Preemptive bound. It is known that they are very close in practice. The aim of this paper is to provide worst case instances where the slack between them is maximal and to prove tight bounds on the slack. We show that the slack is smaller than the maximal processing time.

Keywords: Scheduling; Parallel machines; Lower bounds; Algorithms; Worst case (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-023-05759-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:338:y:2024:i:1:d:10.1007_s10479-023-05759-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-023-05759-8

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().