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 720735-9. - Vol. 37.2009, 6, p. 405-410
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
Biogeography-based optimisation for flexible manufacturing system scheduling problem
Shahla Paslar, (2015)
-
Pattern mining-based pruning strategies in stochastic local searches for scheduling problems
Laurent, Arnaud, (2022)
-
Cui, Haijuan, (2022)
- More ...
-
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)
-
Reducing efficiently the search tree for multiprocessor job-shop scheduling problems
Carballo, Lester, (2013)
- More ...