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)
-
Penz, Louise, (2023)
- More ...
-
Kellerer, Hans, (2013)
-
The symmetric quadratic knapsack problem : approximation and scheduling applications
Kellerer, Hans, (2012)
-
Preemptive scheduling on two identical parallel machines with a single transporter
Kellerer, Hans, (2013)
- More ...