Quantity-based buffer-constrained two-machine flowshop problem : active and passive prefetch models for multimedia applications
Year of publication: |
2012
|
---|---|
Authors: | Kononov, Alexander ; Hong, Jen-shin ; Kononova, Polina ; Lin, Feng-cheng |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 15.2012, 4, p. 487-497
|
Subject: | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | USA | United States | Multimedia |
-
Complexity of the two-stage no-wait assembly problem with setup and removal times separated
Strusevič, Vitalij Aleksandrovič, (1991)
-
Computation of approximate α-points for large scale single machine scheduling problem
Gu, Han Yu, (2008)
-
Novel local-search-based approaches to university examination timetabling
Caramia, Massimiliano, (2008)
- More ...
-
Lin, Feng-cheng, (2009)
-
Complexity and approximability of scheduling resumable proportionally deteriorating jobs
Gawiejnowicz, Stanisław, (2010)
-
A complete 4-parametric complexity classification of short shop scheduling problems
Kononov, Alexander, (2012)
- More ...