caa a22 4500 445838779 CHVBK 20180317145337.0 cr unu---uuuuu 170323e20111001xx s 000 0 eng 10.1007/s10951-011-0231-3 doi (NATIONALLICENCE)springer-10.1007/s10951-011-0231-3 Parallel machine problems with equal processing times: a survey [Elektronische Daten] [Svetlana Kravchenko, Frank Werner] The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. In this paper, we survey existing approaches for the problem class considered. Springer Science+Business Media, LLC, 2011 Parallel machine problem nationallicence Equal processing times nationallicence Non-preemptive problems nationallicence Preemptive problems nationallicence Polynomial algorithms nationallicence NP-hard problems nationallicence Kravchenko Svetlana United Institute of Informatics Problems, 220012, Minsk, Belarus aut Werner Frank Fakultät für Mathematik, Otto-von-Guericke-Universität, 39106, Magdeburg, Germany aut Journal of Scheduling Springer US; http://www.springer-ny.com 14/5(2011-10-01), 435-444 1094-6136 14:5<435 2011 14 10951 https://doi.org/10.1007/s10951-011-0231-3 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10951-011-0231-3 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Kravchenko Svetlana United Institute of Informatics Problems, 220012, Minsk, Belarus aut NATIONALLICENCE 700 1- Werner Frank Fakultät für Mathematik, Otto-von-Guericke-Universität, 39106, Magdeburg, Germany aut NATIONALLICENCE 773 0- Journal of Scheduling Springer US; http://www.springer-ny.com 14/5(2011-10-01), 435-444 1094-6136 14:5<435 2011 14 10951 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer