Approximation Algorithms for Open Shop Variations Subject to Energy Consumption

We consider the open shop scheduling problem subject to speed scaling and energy consumption. The computational complexity is analyzed and approaches to solving various versions of the problem are proposed. The algorithms use a two-stage scheduling scheme. At the first stage, bounds on the objective...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the Steklov Institute of Mathematics Ročník 327; číslo Suppl 1; s. S286 - S301
Hlavný autor:	Zakharova, Yu. V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Moscow Pleiades Publishing 01.12.2024
Predmet:	Mathematics Mathematics and Statistics NP-hardness schedule open shop algorithm
ISSN:	0081-5438, 1531-8605
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!