@article{brueggemann_quality_2006,
	title = {Quality of move-optimal schedules for minimizing total weighted completion time},
	volume = {34},
	issn = {0167-6377},
	url = {http://www.sciencedirect.com/science/article/pii/S0167637705001021},
	doi = {10.1016/j.orl.2005.08.003},
	abstract = {We study the minimum total weighted completion time problem on identical machines. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio 3 2 . In a special case, the approximation ratio is 3 2 - 1 / 6 ≈ 1.092 .},
	number = {5},
	urldate = {2014-01-20TZ},
	journal = {Operations Research Letters},
	author = {Brueggemann, Tobias and Hurink, Johann L. and Kern, Walter},
	month = sep,
	year = {2006},
	keywords = {Approximation, Total weighted completion time, parallel machines},
	pages = {583--590}
}

{"_id":"s9XHY5YhoqxnhZM5L","bibbaseid":"brueggemann-hurink-kern-qualityofmoveoptimalschedulesforminimizingtotalweightedcompletiontime-2006","downloads":0,"creationDate":"2016-12-19T20:50:58.434Z","title":"Quality of move-optimal schedules for minimizing total weighted completion time","author_short":["Brueggemann, T.","Hurink, J. L.","Kern, W."],"year":2006,"bibtype":"article","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"article","type":"article","title":"Quality of move-optimal schedules for minimizing total weighted completion time","volume":"34","issn":"0167-6377","url":"http://www.sciencedirect.com/science/article/pii/S0167637705001021","doi":"10.1016/j.orl.2005.08.003","abstract":"We study the minimum total weighted completion time problem on identical machines. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio 3 2 . In a special case, the approximation ratio is 3 2 - 1 / 6 ≈ 1.092 .","number":"5","urldate":"2014-01-20TZ","journal":"Operations Research Letters","author":[{"propositions":[],"lastnames":["Brueggemann"],"firstnames":["Tobias"],"suffixes":[]},{"propositions":[],"lastnames":["Hurink"],"firstnames":["Johann","L."],"suffixes":[]},{"propositions":[],"lastnames":["Kern"],"firstnames":["Walter"],"suffixes":[]}],"month":"September","year":"2006","keywords":"Approximation, Total weighted completion time, parallel machines","pages":"583--590","bibtex":"@article{brueggemann_quality_2006,\n\ttitle = {Quality of move-optimal schedules for minimizing total weighted completion time},\n\tvolume = {34},\n\tissn = {0167-6377},\n\turl = {http://www.sciencedirect.com/science/article/pii/S0167637705001021},\n\tdoi = {10.1016/j.orl.2005.08.003},\n\tabstract = {We study the minimum total weighted completion time problem on identical machines. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio 3 2 . In a special case, the approximation ratio is 3 2 - 1 / 6 ≈ 1.092 .},\n\tnumber = {5},\n\turldate = {2014-01-20TZ},\n\tjournal = {Operations Research Letters},\n\tauthor = {Brueggemann, Tobias and Hurink, Johann L. and Kern, Walter},\n\tmonth = sep,\n\tyear = {2006},\n\tkeywords = {Approximation, Total weighted completion time, parallel machines},\n\tpages = {583--590}\n}\n\n","author_short":["Brueggemann, T.","Hurink, J. L.","Kern, W."],"key":"brueggemann_quality_2006","id":"brueggemann_quality_2006","bibbaseid":"brueggemann-hurink-kern-qualityofmoveoptimalschedulesforminimizingtotalweightedcompletiontime-2006","role":"author","urls":{"Paper":"http://www.sciencedirect.com/science/article/pii/S0167637705001021"},"keyword":["Approximation","Total weighted completion time","parallel machines"],"downloads":0,"html":""},"search_terms":["quality","move","optimal","schedules","minimizing","total","weighted","completion","time","brueggemann","hurink","kern"],"keywords":["approximation","total weighted completion time","parallel machines"],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}