Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: November 2004 / Received version: March 2005
AMS classification:
90B35, 90B30, 90C59
The research was partly supported by INTAS (Project 03-51-5501)
All correspondence to: Vitali A. Strusevich
Rights and permissions
About this article
Cite this article
Kubzin, M.A., Strusevich, V.A. Two-machine flow shop no-wait scheduling with machine maintenance. 4OR 3, 303–313 (2005). https://doi.org/10.1007/s10288-005-0070-1
Issue Date:
DOI: https://doi.org/10.1007/s10288-005-0070-1