The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
Year of publication: |
November 2016
|
---|---|
Authors: | Epstein, Leah ; Levin, Asaf |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 6, p. 772-774
|
Subject: | Scheduling | Preemptive schedule | Release dates | Power of preemption | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Terminplanung | Time scheduling | Operations Research | Operations research | USA | United States | Theorie | Theory |
-
Soroush, H. M., (2015)
-
On scheduling with non-increasing time slot cost to minimize total weighted completion time
Zhao, Yingchao, (2016)
-
A survey on scheduling problems with due windows
Janiak, Adam, (2015)
- More ...
-
Epstein, Leah, (2011)
-
A unified approach to truthful scheduling on related machines
Epstein, Leah, (2016)
-
Scheduling with processing set restrictions : PTAS results for several variants
Epstein, Leah, (2011)
- More ...