Title
The combinatorics in divisible load scheduling
Authors
[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee
Year of publication
2005
Published in
Article type
scientific article
Publication language
english
Keywords
EN
- divisible loads
- scheduling
- computational complexity
Abstract
EN Divisible load scheduling problem is studied in this work. Though tractability of this problem in the practical cases is considered as its great advantage, we show that it has a hard combinatorial core. Computational hardness and polynomial time solvability of some special cases are shown.
Pages (from - to)
297 - 308
System created by Poznań University of Technology
and Poznan Supercomputing and Networking Center
Log in through eKonto to add to SIS