Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
From MaRDI portal
Publication:703238
DOI10.1016/J.ORL.2003.08.008zbMath1054.90041OpenAlexW2018735909MaRDI QIDQ703238
Fabrice Tercinet, Emmanuel Néron, Christophe Lenté
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.08.008
Related Items (4)
Energetic reasoning revisited: Application to parallel machine scheduling ⋮ Scheduling preparation of doses for a chemotherapy service ⋮ An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem ⋮ Search tree based approaches for parallel machine scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- Minimizing makespan on parallel machines subject to release dates and delivery times
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Some simple scheduling algorithms
This page was built for publication: Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
