Scheduling with time-of-use costs

•Detailed picture of computational tractability for the scheduling problems at hand.•Efficient algorithms for tractable problems.•A fully polynomial-time approximation scheme for an intractable problem. We address a class of problems of scheduling a set of independent jobs onto a single machine that...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 274; H. 3; S. 900 - 908
Hauptverfasser:	Chen, Bo, Zhang, Xiandong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.05.2019
Schlagworte:	Computational complexity Efficient algorithm Polynomial-time approximation scheme Scheduling Time-of-use cost Scheduling Computational complexity Polynomial-time approximation scheme Time-of-use cost Efficient algorithm
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!