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

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 274; číslo 3; s. 900 - 908
Hlavní autori:	Chen, Bo, Zhang, Xiandong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.05.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!