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 | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Produktionssteuerung | Production control |
-
Ahmadizar, Fardin, (2015)
-
An exact algorithm for the single machine problem with unavailability periods
Gharbi, Anis, (2015)
-
Effective meta-heuristics for scheduling on uninform machines with resource-dependent release dates
Li, Kai, (2015)
- More ...
-
Scheduling with processing set restrictions: PTAS results for several variants
Epstein, Leah, (2011)
-
Scheduling with processing set restrictions: PTAS results for several variants
Epstein, Leah, (2011)
-
Epstein, Leah, (2011)
- More ...