@article{csirik_exact_1992,
	title = {The exact {LPT}-bound for maximizing the minimum completion time},
	volume = {11},
	issn = {0167-6377},
	url = {http://www.sciencedirect.com/science/article/B6V8M-48MPT46-9B/2/e8c95c822220425c87141c8c79341bd3},
	doi = {10.1016/0167-6377(92)90004-M},
	number = {5},
	urldate = {2008-12-16TZ},
	journal = {Operations Research Letters},
	author = {Csirik, János and Kellerer, Hans and Woeginger, Gerhard},
	month = jun,
	year = {1992},
	keywords = {combinatorial problems, suboptimal algorithms},
	pages = {281--287}
}

{"_id":"C2kNNTodH2qHdR4Bu","bibbaseid":"csirik-kellerer-woeginger-theexactlptboundformaximizingtheminimumcompletiontime-1992","downloads":0,"creationDate":"2016-12-19T20:50:58.356Z","title":"The exact LPT-bound for maximizing the minimum completion time","author_short":["Csirik, J.","Kellerer, H.","Woeginger, G."],"year":1992,"bibtype":"article","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"article","type":"article","title":"The exact LPT-bound for maximizing the minimum completion time","volume":"11","issn":"0167-6377","url":"http://www.sciencedirect.com/science/article/B6V8M-48MPT46-9B/2/e8c95c822220425c87141c8c79341bd3","doi":"10.1016/0167-6377(92)90004-M","number":"5","urldate":"2008-12-16TZ","journal":"Operations Research Letters","author":[{"propositions":[],"lastnames":["Csirik"],"firstnames":["János"],"suffixes":[]},{"propositions":[],"lastnames":["Kellerer"],"firstnames":["Hans"],"suffixes":[]},{"propositions":[],"lastnames":["Woeginger"],"firstnames":["Gerhard"],"suffixes":[]}],"month":"June","year":"1992","keywords":"combinatorial problems, suboptimal algorithms","pages":"281--287","bibtex":"@article{csirik_exact_1992,\n\ttitle = {The exact {LPT}-bound for maximizing the minimum completion time},\n\tvolume = {11},\n\tissn = {0167-6377},\n\turl = {http://www.sciencedirect.com/science/article/B6V8M-48MPT46-9B/2/e8c95c822220425c87141c8c79341bd3},\n\tdoi = {10.1016/0167-6377(92)90004-M},\n\tnumber = {5},\n\turldate = {2008-12-16TZ},\n\tjournal = {Operations Research Letters},\n\tauthor = {Csirik, János and Kellerer, Hans and Woeginger, Gerhard},\n\tmonth = jun,\n\tyear = {1992},\n\tkeywords = {combinatorial problems, suboptimal algorithms},\n\tpages = {281--287}\n}\n\n","author_short":["Csirik, J.","Kellerer, H.","Woeginger, G."],"key":"csirik_exact_1992","id":"csirik_exact_1992","bibbaseid":"csirik-kellerer-woeginger-theexactlptboundformaximizingtheminimumcompletiontime-1992","role":"author","urls":{"Paper":"http://www.sciencedirect.com/science/article/B6V8M-48MPT46-9B/2/e8c95c822220425c87141c8c79341bd3"},"keyword":["combinatorial problems","suboptimal algorithms"],"downloads":0,"html":""},"search_terms":["exact","lpt","bound","maximizing","minimum","completion","time","csirik","kellerer","woeginger"],"keywords":["combinatorial problems","suboptimal algorithms"],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}