The delivery man problem and cumulative matroids
Operations Research
Scheduling in a sequence dependent setup environment with genetic search
Computers and Operations Research - Special issue on genetic algorithms
Earliness-tardiness scheduling with setup considerations
Computers and Operations Research
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
Computers and Operations Research
Computers and Operations Research
A GRASP based on DE to solve single machine scheduling problem with SDST
Computational Optimization and Applications
The time dependent traveling salesman problem: polyhedra and branch-cut-and-price algorithm
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
The Delivery Man Problem with time windows
Discrete Optimization
Computers and Operations Research
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
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|s"i"j|@?C"j (i.e. minimizing total flow time on a single machine under sequence dependent setup times) and 1|s"i"j|@?T"j (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|s"i"j|@?C"j and 1|s"i"j|@?T"j having up to 50 and 45 jobs respectively.