Heuristics for a coupled-operation scheduling problem
Heuristics for a coupled-operation scheduling problem
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.
scheduling/sequencing, bounded delay, heuristics, local search, combinatorial optimization
1375-1388
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Whitehead, J.D.
5ddc4b76-a666-4820-8e00-79d85ca79d40
October 2007
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Whitehead, J.D.
5ddc4b76-a666-4820-8e00-79d85ca79d40
Potts, C.N. and Whitehead, J.D.
(2007)
Heuristics for a coupled-operation scheduling problem.
Journal of the Operational Research Society, 58 (10), .
(doi:10.1057/palgrave.jors.2602272).
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.
This record has no associated files available for download.
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: 15 Mar 2024 08:51
Export record
Altmetrics
Contributors
Author:
J.D. Whitehead
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