Optimizing memory allocation for multistage scheduling including setup times
DOI10.1007/s10951-015-0437-xzbMath1390.90306OpenAlexW1138647192MaRDI QIDQ1702728
Mathias Coqblin, Anne Benoit, Jean-Marc Nicod, Veronika Rehn-Sonigo
Publication date: 28 February 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02082773/file/journalOfScheduling-sti-bi_submitted.pdf
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Mapping pipeline skeletons onto heterogeneous platforms
- Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
- Optimizing memory allocation for multistage scheduling including setup times
- Optimal use of mixed task and data parallelism for pipelined computations
- The significance of reducing setup times/setup costs
- A survey of scheduling problems with setup times or costs
This page was built for publication: Optimizing memory allocation for multistage scheduling including setup times
