Interweaving real-time jobs with energy harvesting to maximize throughput
From MaRDI portal
Publication:6091174
DOI10.1007/978-3-031-27051-2_26arXiv2212.07002MaRDI QIDQ6091174
Bhargav Samineni, Baruch Schieber, Soroush Vahidi
Publication date: 24 November 2023
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.07002
Cites Work
- Unnamed Item
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Single machine scheduling problems with financial resource constraints: some complexity results and properties
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Minimizing makespan on a single machine with release dates and inventory constraints
- Basic scheduling problems with raw material constraints
This page was built for publication: Interweaving real-time jobs with energy harvesting to maximize throughput
