Fast algorithms to minimize the makespan
β
Jinliang Cheng; George Steiner; Paul Stephenson
π
Article
π
2002
π
Springer US
π
English
β 186 KB
π 2 views
We consider the two-machine ow-shop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a uniΓΏed treatment of various sequenceinterchange operators and derive powerful new dominance orders, which are incorporated into branchand-bound