Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
| Year of publication: |
2009
|
|---|---|
| Authors: | Kellerer, Hans ; Kubzin, Mikhail A. ; Strusevich, Vitaly A. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 199.2009, 1 (16.11.), p. 111-116
|
| Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Operations Research | Operations research | Durchlaufzeit | Lead time |
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
Minimizing total tardiness on parallel machines with preemptions
Kravchenko, Svetlana A., (2012)
- More ...
-
The two-flight low risk helicopter transportation problem under the split pickup scenario
Kellerer, Hans, (2023)
-
Kellerer, Hans, (2019)
-
Halman, Nir, (2018)
- More ...