@book{d670f28187044d9b835622f759c9286f,

title = "Matching based exponential neighborhoods for parallel machine scheduling",

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.",

keywords = "MSC-68M20, MSC-90B35, IR-65957, METIS-225433, EWI-3593",

author = "T. Brueggemann and Hurink, {Johann L.}",

note = "Imported from MEMORANDA",

year = "2005",

language = "Undefined",

isbn = "0169-2690",

series = "Memorandum Afdeling TW",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1773",

}