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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 296; H. 2; S. 423 - 439
1. Verfasser:	Shabtay, Dvir
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.01.2022
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!