Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem

@article{Pan2006BranchandboundAF,
  title={Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem},
  author={Yunpeng Pan and Leyuan Shi},
  journal={European Journal of Operational Research},
  year={2006},
  volume={168},
  pages={1030-1039}
}
Abstract Despite being strongly NP -hard, the one-machine sequencing problem that minimizes the makespan was thought to be computationally inexpensive to solve using Carlier’s algorithm (CA). CA achieved excellent results on random instances with 50–10,000 jobs. However, a thorough computational study reveals that hard instances do exist for CA. In this paper, we present three improved branch-and-bound algorithms based on CA and other existing techniques. We also develop a new lower bound and a… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

A New Solution Approach to the General Min-Max Sequencing Problem

  • 2006 6th World Congress on Intelligent Control and Automation
  • 2006
VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND

Dual constrained single machine sequencing to minimize total weighted completion time

  • IEEE Transactions on Automation Science and Engineering
  • 2005
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND

On the optimal solution of the general min-max sequencing problem

  • 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)
  • 2004