@InProceedings{koutecky_et_al:LIPIcs.ISAAC.2020.18,
  author =	{Kouteck\'{y}, Martin and Zink, Johannes},
  title =	{{Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines}},
  booktitle =	{31st International Symposium on Algorithms and Computation (ISAAC 2020)},
  pages =	{18:1--18:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-173-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{181},
  editor =	{Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.18},
  URN =		{urn:nbn:de:0030-drops-133620},
  doi =		{10.4230/LIPIcs.ISAAC.2020.18},
  annote =	{Keywords: Scheduling, cutting stock, hardness, parameterized complexity}
}