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)

Kurzanzeige
cbs.date.changed2022-03-29
cbs.date.creation2016-02-11
cbs.picatypeOa
cbs.publication.displayform[Magdeburg] : [Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik], August 4, 2013
dc.contributor.authorHasani, Keramat
dc.contributor.authorKravčenko, Svetlana A.
dc.contributor.authorWerner, Frank
dc.date.accessioned2025-05-28T21:28:21Z
dc.date.issued2013
dc.format.extent1 Online-Ressource (8 Seiten = 0,21 MB)
dc.genrebook
dc.identifier.ppn847435539
dc.identifier.urihttps://epflicht.bibliothek.uni-halle.de/handle/123456789/2839
dc.identifier.urnurn:nbn:de:gbv:3:2-52465
dc.identifier.vl-id2379006
dc.language.isoeng
dc.publisher[Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik]
dc.relation.ispartofseriesPreprints ; 2013,13 ppn:622944983
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc510
dc.titleMinimizing 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)
dc.typeBook
dspace.entity.typeMonograph
local.accessrights.itemAnonymous
local.openaccesstrue

Dateien

Originalbündel
Gerade angezeigt 1 - 1 von 1
Vorschaubild
Name:
urn_nbn_de_gbv_3_2-52465.pdf
Größe:
221.07 KB
Format:
Adobe Portable Document Format
Beschreibung:
Minimizing total weighted completion time approximately for the paraellel machine problem with a single server
Herunterladen

Sammlungen

E-Book