In this paper, the problem of minimizing the total completion time on a single machine with the presence of release dates is studied. We introduce two different approaches leading to very large-scale neighborhoods in which the best improving neighbor can be determined in polynomial time. Furthermore, computational results are presented to get insight in the performance of the developed neighborhoods.
- Local search
- Single machine
- Very large-scale neighborhoods
Brueggemann, T., & Hurink, J. L. (2007). Two very large-scale neighborhoods for single machine scheduling. OR Spectrum = OR Spektrum, 29(SINTEF A13/3), 513-533. [10.1007/s00291-006-0052-5]. https://doi.org/10.1007/s00291-006-0052-5