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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the Steklov Institute of Mathematics Jg. 327; H. Suppl 1; S. S286 - S301
1. Verfasser:	Zakharova, Yu. V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.12.2024
Schlagworte:	Mathematics Mathematics and Statistics NP-hardness schedule open shop algorithm
ISSN:	0081-5438, 1531-8605
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!