Matching based exponential neighborhoods for parallel machine scheduling

Share/Save/Bookmark

Brueggemann, T. and Hurink, J.L. (2005) Matching based exponential neighborhoods for parallel machine scheduling. [Report]

open access
[img]
Preview
PDF
218kB
Abstract:
We study the minimum total weighted completion time problem on parallel machines, which is known to be strongly $\mathcal{NP}$-hard. We develop general ideas leading to exponential neighborhoods in which the best improving neighbor can be determined by calculating a maximum weighted matching of an improvement graph. In a second step we introduce neighborhoods that form the base for the exponential neighborhoods.
Item Type:Report
Additional information:Imported from MEMORANDA
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65957
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 225433