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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 43; no. 2; pp. 350 - 362
Main Authors:	Yuan, Yuan, Lan, Yan, Ding, Ning, Han, Xin
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2022 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!