The University of Southampton
University of Southampton Institutional Repository

Scheduling three-operation jobs in a two-machine flow shop to minimize makespan: Models and algorithms for planning and scheduling problems

Gupta, Jatinder N.D., Koulamas, Christos P., Kyparisis, George J., Potts, Chris N. and Strusevich, Vitality A. (2004) Scheduling three-operation jobs in a two-machine flow shop to minimize makespan: Models and algorithms for planning and scheduling problems Annals of Operations Research, 129, (1-4), pp. 171-185. (doi:10.1023/B:ANOR.0000030687.72169.c7).

Record type: Article

Abstract

This paper considers a variant of the classical problem of minimizing makespan in a two-machine flow shop. In this variant, each job has three operations, where the first operation must be performed on the first machine, the second operation can be performed on either machine but cannot be preempted, and the third operation must be performed on the second machine.
The NP-hard nature of the problem motivates the design and analysis of approximation algorithms. It is shown that a schedule in which the operations are sequenced arbitrarily, but without inserted machine idle time, has a worst-case performance ratio of 2. Also, an algorithm that constructs four schedules and selects the best is shown to have a worst-case performance ratio of 3/2. A polynomial time approximation scheme (PTAS) is also presented.

Full text not available from this repository.

More information

Published date: 2004
Keywords: scheduling, flow shop, makespan, approximation algorithm, polynomial time approximation scheme
Organisations: Operational Research

Identifiers

Local EPrints ID: 29626
URI: http://eprints.soton.ac.uk/id/eprint/29626
PURE UUID: a3714e1f-54d6-43cf-82e4-293eb93184f9

Catalogue record

Date deposited: 12 May 2006
Last modified: 17 Jul 2017 15:57

Export record

Altmetrics

Contributors

Author: Jatinder N.D. Gupta
Author: Christos P. Koulamas
Author: George J. Kyparisis
Author: Chris N. Potts
Author: Vitality A. Strusevich

University divisions

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.

×