A PTAS for non-resumable open shop scheduling with an availability constraint

Shop scheduling problem is one of the most classical problems in combinatorial optimization. In this paper, we study two-machine open shop scheduling problem, provided that one machine is subject to maintenance period which has to be performed in a fixed time interval. The target is to minimize the...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization Jg. 43; H. 2; S. 350 - 362
Hauptverfasser:	Yuan, Yuan, Lan, Yan, Ding, Ning, Han, Xin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.03.2022 Springer Nature B.V
Schlagworte:	Combinatorial analysis Combinatorics Convex and Discrete Geometry Job shops Maintenance Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Scheduling Theory of Computation Open shop scheduling Machine non-availability Polynomial time approximation scheme Approximation algorithm
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!