We study the problem of minimizing total completion time on a single machine with the presence of release dates. We present two different approaches leading to exponential 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.
|Place of Publication||Enschede|
|Publisher||University of Twente, Department of Applied Mathematics|
|Number of pages||24|
|Publication status||Published - 2005|
|Name||Memorandum Afdeling TW|
|Publisher||Department of Applied Mathematics, University of Twente|
Brueggemann, T., & Hurink, J. L. (2005). Two exponential neighborhoods for single machine scheduling. (Memorandum Afdeling TW; No. 1776). Enschede: University of Twente, Department of Applied Mathematics.