A study of single-machine scheduling problem to maximize throughput
Year of publication: |
2013
|
---|---|
Authors: | Vakhania, Nodari |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 16.2013, 4, p. 395-403
|
Subject: | Scheduling | Single-machine | Release time | Due-date | Algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Produktionssteuerung | Production control |
-
An exact algorithm for the single machine problem with unavailability periods
Gharbi, Anis, (2015)
-
Competitive two-agent scheduling with release dates and preemption on a single machine
Li, Shi-Sheng, (2023)
-
Two-machine flow shop and open shop scheduling problems with a single maintenance window
Mosheiov, Gur, (2018)
- More ...
-
Vakhania, Nodari, (2009)
-
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 ...