Highly Influenced

# Heuristics for a coupled-operation scheduling problem

@article{Potts2007HeuristicsFA, title={Heuristics for a coupled-operation scheduling problem}, author={Chris N. Potts and J. Douglass Whitehead}, journal={JORS}, year={2007}, volume={58}, pages={1375-1388} }

- Published 2007 in JORS
DOI:10.1057/palgrave.jors.2602272

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 minimize 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(n2) complexity for each permutation. Several heuristic algorithms are proposed: a deterministic and… CONTINUE READING