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

Full description

Bibliographic Details

Published in:	Proceedings of the Steklov Institute of Mathematics Vol. 327; no. Suppl 1; pp. S286 - S301
Main Author:	Zakharova, Yu. V.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.12.2024
Subjects:	Mathematics Mathematics and Statistics NP-hardness schedule open shop algorithm
ISSN:	0081-5438, 1531-8605
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!