Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates

The authors present a family of rolling horizon procedures for the problem of minimizing total completion time on a single machine with release times. These procedures develop solutions by using information about future job arrivals at each decision point. This approach provides an excellent compromise between the excessive computation time required by exact solution methods and the poor solution quality that myopic dispatching rules may yield. Extensive computational experiments show that these procedures consistently obtain high-quality solutions in very reasonable CPU times.