A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
Year of publication: |
February 2016
|
---|---|
Authors: | Zhao, Kejun ; Lu, Xiwen ; Gu, Manzhan |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 19.2016, 1, p. 21-31
|
Subject: | Multi-agent scheduling | Identical machines | Makespan | Approximation algorithm | Performance ratio vector | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Agentenbasierte Modellierung | Agent-based modeling | Theorie | Theory | Operations Research | Operations research |
-
Rault, Tifenn, (2024)
-
An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
Gu, Manzhan, (2018)
-
Prot, Damien, (2013)
- More ...
-
An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
Gu, Manzhan, (2018)
-
Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
Gu, Manzhan, (2011)
-
Optimal on-line algorithms for one batch machine with grouped processing times
Yang, Fang, (2011)
- More ...