Two exponential neighborhoods for single machine scheduling

Share/Save/Bookmark

Brueggemann, T. and Hurink, J.L. (2005) Two exponential neighborhoods for single machine scheduling. [Report]

[img]
Preview
PDF
236Kb
Abstract:
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.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65960
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 225434