zbMATH — the first resource for mathematics

Two-machine flow shop no-wait scheduling with machine maintenance. (English) Zbl 1134.90387
Summary: We study a two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is subject to mandatory maintenance. The length of the maintenance period is defined by a non-decreasing function that depends on the starting time of that maintenance. The objective is to minimize the completion time of all activities. We present a polynomial-time approximation scheme for this problem.

90B35 Deterministic scheduling theory in operations research
90B30 Production models
90C59 Approximation methods and heuristics in mathematical programming
Full Text: DOI