Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
Year of publication: |
2009
|
---|---|
Authors: | Vakhania, Nodari |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 37.2009, 6, p. 405-410
|
Saved in:
Saved in favorites
Similar items by person
-
Vakhania, Nodari, (2009)
-
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Shchepin, Evgeny V., (2008)
-
A note on the proof of the complexity of the little-preemptive open-shop problem
Shchepin, Evgeny V., (2011)
- More ...