A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs

Eric Angel, Evripidis Bampis, Alexander Kononov. A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. In Friedhelm Meyer auf der Heide, editor, Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings. Volume 2161 of Lecture Notes in Computer Science, pages 194-205, Springer, 2001. [doi]

@inproceedings{AngelBK01,
  title = {A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs},
  author = {Eric Angel and Evripidis Bampis and Alexander Kononov},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2161/21610194.htm},
  researchr = {https://researchr.org/publication/AngelBK01},
  cites = {0},
  citedby = {0},
  pages = {194-205},
  booktitle = {Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings},
  editor = {Friedhelm Meyer auf der Heide},
  volume = {2161},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42493-8},
}