Single-machine scheduling with machine unavailability periods and resource dependent processing times

•We study a single-machine scheduling problem with a machine-unavailability period.•Processing times are resource-dependent.•The problem is known to be NP-hard.•We focus on the design of pseudo-polynomial time and approximation algorithms.•Extension to the case of a fixed number of unavailability pe...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 296; číslo 2; s. 423 - 439
Hlavný autor:	Shabtay, Dvir
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.01.2022
Predmet:	Approximation algorithms Controllable processing time Machine unavailability period Pseudo polynomial time algorithm Resource allocation Single-machine scheduling Single-machine scheduling Approximation algorithms Pseudo polynomial time algorithm Machine unavailability period Controllable processing time Resource allocation
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!