The University of Southampton
University of Southampton Institutional Repository

Heuristics for a coupled-operation scheduling problem

Potts, C.N. and Whitehead, J.D. (2007) Heuristics for a coupled-operation scheduling problem Journal of the Operational Research Society, 58, (10), pp. 1375-1388. (doi:10.1057/palgrave.jors.2602272).

Record type: Article

Abstract

In this paper, we study a strongly NP-hard single machine scheduling problem in which each job consists of two operations that are separated by a time delay which lies within a specified range. The objective is to minimise the makespan. Determining the feasibility and, if applicable, makespan of any proposed permutation of the operations is non-trivial, requiring a longest path algorithm with O(n^2) complexity for each permutation.
Several heuristic algorithms are proposed: a deterministic and randomised construction algorithm, three descent algorithms and two reactive tabu search algorithms. The local search algorithms use a first improvement neighbourhood and mainly visit only feasible solutions within the search space. Results of extensive computational tests are reported, showing that the heavy computational burden of testing potential solutions renders the local search algorithms uncompetitive in comparison to the construction algorithms. The iterated descent algorithm performs least well.

Full text not available from this repository.

More information

Published date: October 2007
Additional Information: Theoretical paper
Keywords: scheduling/sequencing, bounded delay, heuristics, local search, combinatorial optimization
Organisations: Operational Research

Identifiers

Local EPrints ID: 42943
URI: http://eprints.soton.ac.uk/id/eprint/42943
ISSN: 0160-5682
PURE UUID: d41adbfe-3ef0-4e4d-8e7f-c2253e01494c

Catalogue record

Date deposited: 03 Jan 2007
Last modified: 17 Jul 2017 15:20

Export record

Altmetrics

Contributors

Author: C.N. Potts
Author: J.D. Whitehead

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.

×