@InProceedings{das_et_al:LIPIcs.ESA.2017.31,
author = {Das, Syamantak and Wiese, Andreas},
title = {{On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine}},
booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-049-1},
ISSN = {1868-8969},
year = {2017},
volume = {87},
editor = {Pruhs, Kirk and Sohler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.31},
URN = {urn:nbn:de:0030-drops-78453},
doi = {10.4230/LIPIcs.ESA.2017.31},
annote = {Keywords: approximation algorithms, scheduling, makespan minimization}
}