Single-machine scheduling with an external resource

highlights•We study single-machine scheduling with an external resource.•We look at four different classes of problems with an external resource.•For each class, we consider four different classical objective functions.•We provide a complexity analysis for different members of these four classes. Th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 293; číslo 2; s. 457 - 468
Hlavní autoři: Briskorn, Dirk, Davari, Morteza, Matuschke, Jannik
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.09.2021
Témata:
Complexity
External resource
Pseudo-polynomial algorithm
Scheduling
Single-machine scheduling
Single-machine scheduling
Pseudo-polynomial algorithm
Scheduling
External resource
Complexity
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:highlights•We study single-machine scheduling with an external resource.•We look at four different classes of problems with an external resource.•For each class, we consider four different classical objective functions.•We provide a complexity analysis for different members of these four classes. This paper studies the complexity of single-machine scheduling with an external resource, which is rented for a non-interrupted period. Jobs that need this external resource are executed only when the external resource is available. There is a cost associated with the scheduling of jobs and a cost associated with the duration of the renting period of the external resource. We look at four classes of problems with an external resource: a class of problems where the renting period is budgeted and the scheduling cost needs to be minimized, a class of problems where the scheduling cost is budgeted and the renting period needs to be minimized, a class of two-objective problems where both, the renting period and the scheduling cost, are to be minimized, and a class of problems where a linear combination of the scheduling cost and the renting period is minimized. We provide a thorough complexity analysis (NP-hardness proofs and (pseudo-)polynomial algorithms) for different members of these four classes.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2020.12.045