In this paper, we consider scheduling problems on a single machine in a sequence dependent setup environment. For these problems, we introduce several integer programming formulations of varying size and strength. Computational experiments conducted on instances of 1 | si j | ∑ Cj (i.e. minimizing total flow time on a single machine under sequence dependent setup times) and 1 | si j | ∑ Tj (i.e. minimizing total tardiness on a single machine under sequence dependent setup times) illustrate the benefits of using stronger formulations, even though the computation of their LP relaxation is more time consuming. Incorporating these improved LP relaxation bounds, we propose an exact branch-and-bound algorithm able to solve instances of 1 | si j | ∑ Cj and 1 | si j | ∑ Tj having up to 50 and 45 jobs respectively. © 2008 Elsevier B.V. All rights reserved.
https://doi.org/10.1016/j.disopt.2008.04.001Cite as:
@article{Bigras_2008,
doi = {10.1016/j.disopt.2008.04.001},
url = {https://doi.org/10.1016%2Fj.disopt.2008.04.001},
year = 2008,
month = {nov},
publisher = {Elsevier {BV}},
volume = {5},
number = {4},
pages = {685--699},
author = {Louis-Philippe Bigras and Michel Gamache and Gilles Savard},
title = {The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times},
journal = {Discrete Optimization}
}