The University of Southampton
University of Southampton Institutional Repository

Approximation results for flow shop scheduling problems with machine availability constraints

Approximation results for flow shop scheduling problems with machine availability constraints
Approximation results for flow shop scheduling problems with machine availability constraints
This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenarios in which some proportion of the processing is repeated but the job is otherwise resumable. For the
resumable scenario, problems with non-availability intervals on one of the machines are shown to admit fully polynomial-time approximation schemes that are based on an extended dynamic programming algorithm. For the problem with several non-availability intervals on the first machine, we present a fast 3/2-approximation algorithm. For the problem with one non-availability interval under the semi-resumable scenario, polynomial-time approximation schemes are developed.
flow shop scheduling, machine non-availability, approximation algorithm
0305-0548
379-390
Kubzin, Mikhail A.
ba32b20f-306f-4285-bb25-9baa55a03d71
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Strusevich, Vitaly A.
aad7d20c-206c-4044-9863-4dd8061d1c57
Kubzin, Mikhail A.
ba32b20f-306f-4285-bb25-9baa55a03d71
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Strusevich, Vitaly A.
aad7d20c-206c-4044-9863-4dd8061d1c57

Kubzin, Mikhail A., Potts, Chris N. and Strusevich, Vitaly A. (2009) Approximation results for flow shop scheduling problems with machine availability constraints. Computers and Operations Research, 36 (2), 379-390. (doi:10.1016/j.cor.2007.10.013).

Record type: Article

Abstract

This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenarios in which some proportion of the processing is repeated but the job is otherwise resumable. For the
resumable scenario, problems with non-availability intervals on one of the machines are shown to admit fully polynomial-time approximation schemes that are based on an extended dynamic programming algorithm. For the problem with several non-availability intervals on the first machine, we present a fast 3/2-approximation algorithm. For the problem with one non-availability interval under the semi-resumable scenario, polynomial-time approximation schemes are developed.

Text
LimAvailE-Prints.pdf - Accepted Manuscript
Download (177kB)

More information

Published date: February 2009
Keywords: flow shop scheduling, machine non-availability, approximation algorithm
Organisations: Operational Research

Identifiers

Local EPrints ID: 149837
URI: http://eprints.soton.ac.uk/id/eprint/149837
ISSN: 0305-0548
PURE UUID: d7de4bec-33e2-4e08-88c3-9d5022751879

Catalogue record

Date deposited: 04 May 2010 08:43
Last modified: 08 Jan 2022 05:30

Export record

Altmetrics

Contributors

Author: Mikhail A. Kubzin
Author: Chris N. Potts
Author: Vitaly A. Strusevich

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×