Scheduling to Minimize Average Completion Time Revisited: Deterministic On-line Algorithms
Year of publication: |
2004-02-06
|
---|---|
Authors: | Megow, Nicole ; Schulz, Andreas S. |
Institutions: | Sloan School of Management, Massachusetts Institute of Technology (MIT) |
Subject: | Scheduling | Sequencing | Approximation Algorithms | On-line Algorithms | Competitive Ratio |
-
Wu, Yong, (2011)
-
Online scheduling with immediate and reliable lead-time quotation
Zheng, Feifeng, (2014)
-
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
Liu, Peihai, (2014)
- More ...
-
On-line scheduling to minimize average completion time revisited
Megow, Nicole, (2004)
-
On-Line Scheduling to Minimize Average Completion Time Revisited
Megow, Nicole, (2014)
-
Scheduling to Minimize Average Completion Time Revisited : Deterministic On-Line Algorithms
Megow, Nicole, (2003)
- More ...