Theoretical and practical issues in single-machine scheduling with two job release and delivery times
Year of publication: |
2021
|
---|---|
Authors: | Reynoso, Alejandro ; Vakhania, Nodari |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 24.2021, 6, p. 615-647
|
Subject: | Polynomial and pseudo-polynomial time algorithms | SUBSET SUM | Single-machine scheduling | Release time | Delivery time | Time complexity | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time |
-
Semi-online scheduling for jobs with release times
Li, Rongheng, (2013)
-
A study of single-machine scheduling problem to maximize throughput
Vakhania, Nodari, (2013)
-
Seidgar, Hany, (2015)
- More ...
-
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Baptiste, Philippe, (2004)
-
An optimal rounding gives a better approximation for scheduling unrelated machines
Shchepin, Evgeny V., (2005)
-
A note on the proof of the complexity of the little-preemptive open-shop problem
Shchepin, Evgeny V., (2011)
- More ...