The battery switching station scheduling problem
From MaRDI portal
Publication:1939710
DOI10.1016/j.orl.2012.09.007zbMath1258.90042MaRDI QIDQ1939710
Publication date: 5 March 2013
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.09.007
90B35: Deterministic scheduling theory in operations research
Cites Work
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Preemptive Scheduling with Due Dates
- Preemptive Scheduling of Uniform Processor Systems
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm