Sequential scheduling on identical machines
Year of publication: |
2015
|
---|---|
Authors: | Hassin, Refael ; Yovel, Uri |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 5, p. 530-533
|
Subject: | Sequential price of anarchy | Machine scheduling | Congestion games | Load balancing | Subgame-perfect equilibrium | Makespan minimization | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Engpass | Bottleneck | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Nichtkooperatives Spiel | Noncooperative game |
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
-
A note on the Coffman-Sethi bound for LPT scheduling
Blocher, James D., (2015)
-
Exact algorithms to minimize makespan on single and parallel batch processing machines
Muter, İbrahim, (2020)
- More ...
-
Minimizing weighted earliness–tardiness and due-date cost with unit processing-time jobs
Mosheiov, Gur, (2006)
-
Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job"
Mosheiov, Gur, (2004)
-
Predictive ranking of computer scientists using CiteSeer data
Feitelson, Dror G., (2004)
- More ...