The exact LPT-bound for maximizing the minimum completion time. Csirik, J., Kellerer, H., & Woeginger, G. Operations Research Letters, 11(5):281--287, June, 1992.
The exact LPT-bound for maximizing the minimum completion time [link]Paper  doi  bibtex   
@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}
}

Downloads: 0