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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 43; číslo 2; s. 350 - 362
Hlavní autori:	Yuan, Yuan, Lan, Yan, Ding, Ning, Han, Xin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2022 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!