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

Gespeichert in:
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!
Beschreibung
Zusammenfassung:•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 charges each job for its processing under variable time-of-use tariffs. Our scheduling objective is to minimize the total cost of processing all the jobs subject to a minimum level of performance in one of the regular scheduling criteria. For each of the problems in the class, we establish its computational tractability. For those that are tractable we provide an efficient algorithm, while for those that are intractable we provide a pseudo-polynomial-time algorithm or a polynomial-time approximation scheme.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2018.11.002