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}
}
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

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags

  • JND Gupta
  • J Glob Opt
  • 1996
1 Excerpt

Scheduling for a multifunction phased array radar system

  • AJ Orman, CN Potts, AK Shahani, AR Moore
  • Eur J Opl Res
  • 1996
1 Excerpt

A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems

  • CKY Lin, KB Haley, C Sparks
  • Eur J Opl Res
  • 1995
2 Excerpts

Similar Papers

Loading similar papers…