Minimizing total weighted completion time approximately for the paraellel machine problem with a single server / Keramat Hasani (Islamic Azad University, Malayer Branch, Malayer, Iran), Svetlana A. Kravchenko (United Institute of Informatics Problems, Minsk, Belarus), Frank Werner (Otto-von-Guericke-Universität, Fakultät für Mathematik, Magdeburg, Germany)

Hasani, KeramatKravčenko, Svetlana A.Werner, Frank2025-05-282013https://epflicht.bibliothek.uni-halle.de/handle/123456789/2839847435539urn:nbn:de:gbv:3:2-5246523790061 Online-Ressource (8 Seiten = 0,21 MB)enghttp://rightsstatements.org/vocab/InC/1.0/510Minimizing total weighted completion time approximately for the paraellel machine problem with a single server / Keramat Hasani (Islamic Azad University, Malayer Branch, Malayer, Iran), Svetlana A. Kravchenko (United Institute of Informatics Problems, Minsk, Belarus), Frank Werner (Otto-von-Guericke-Universität, Fakultät für Mathematik, Magdeburg, Germany)Book