Single-machine scheduling with operator non-availability to minimize total weighted completion time

In this paper, we investigate the single-machine scheduling with an operator non-availability period to minimize total weighted completion time, where the operator non-availability period is an open time interval in which no job can be started or be completed. For this problem, we present a pseudo-p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information sciences Jg. 445-446; S. 1 - 5
Hauptverfasser:	Wan, Long, Yuan, Jinjiang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.06.2018
Schlagworte:	Dynamic programming Fully polynomial-time approximation scheme Non-availability period Single-machine scheduling Single-machine scheduling Fully polynomial-time approximation scheme Dynamic programming 90C27 Non-availability period 90B35
ISSN:	0020-0255, 1872-6291
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this paper, we investigate the single-machine scheduling with an operator non-availability period to minimize total weighted completion time, where the operator non-availability period is an open time interval in which no job can be started or be completed. For this problem, we present a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme. Our results address two open problems proposed in Chen et al. [2].
ISSN:	0020-0255 1872-6291
DOI:	10.1016/j.ins.2018.03.005