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

Full text of this item is not available from this server.

Official URL: http://dx.doi.org/10.1057/palg...rs.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.

Edit this item (Staff only)

References in Article

Ahuja RK, Magnanti TL and Orlin JB (1993). Network flows: theory, algorithms and applications. Prentice Hall.
Balas E, Lenstra JK and Vazacopoulos A (1995). The one machine problem with delayed precedence constraints and its use in job shop scheduling. Mngt Sci 41: 94-109.
Battiti R and Tecchiolli G (1994). The reactive tabu search. ORSA J Comput 6: 126-140.
Brucker P, Hilbig T and Hurink J (1999). A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Discrete App Math 94: 77-99.
Brucker P and Knust S (1999). Complexity results for single-machine problems with positive finish-start time-lags. Computing 63: 299-316.
Bruno J, Jones JW and So K (1980). Deterministic scheduling with pipelined processors. IEEE Trans Comput 29: 308-316.
Gallo G and Pallottino S (1988). Shortest path algorithms. Ann Opns Res 13: 703-709.
Gupta JND (1996). Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags. J Glob Opt 9: 239-250.
Hurink J and Keuchel J (2001). Local search algorithms for a single machine scheduling problem with positive and negative time lags. Discrete App Math 112: 179-197.
Lin CKY and Haley KB (1993). Scheduling two-phase jobs with arbitrary time lags in a single-server system. IMA J Math Appl Bus Ind 5: 143-161.
Lin CKY, Haley KB and Sparks C (1995). A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems. Eur J Opl Res 83: 330-346.
Munier A and Sourd F (2003). Scheduling chains on a single machine with non-negative time lags. Math Meth Opns Res 57: 111-123.
Orman AJ and Potts CN (1997). On the complexity of coupled-task scheduling. Discrete App Math 72: 141-154.
Orman AJ, Potts CN, Shahani AK and Moore AR (1996). Scheduling for a multifunction phased array radar system. Eur J Opl Res 90: 13-25.
Wikum ED, Llewellyn DC and Nemhauser GL (1994). One-machine generalized precedence constrained scheduling problems. Opns Res Let 16: 87-99.
Yu Wenci (1996). The Two Machine Flow Shop Problem with Delays and the One Machine Total Tardiness Problem. PhD thesis, Eindhoven University of Technology.