Time-of-use scheduling problem with equal-length jobs
From MaRDI portal
Publication:6111939
DOI10.1007/978-3-031-20350-3_3OpenAlexW4313349379MaRDI QIDQ6111939
No author found.
Publication date: 4 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-20350-3_3
Cites Work
- Unnamed Item
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Preemptive scheduling of equal-length jobs to maximize weighted throughput.
- On scheduling with non-increasing time slot cost to minimize total weighted completion time
- Scheduling with time-of-use costs
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs
- Calibration scheduling with time slot cost
- Optimal algorithms for scheduling under time-of-use tariffs
- Algorithms for Cost-Aware Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Stability of service under time-of-use pricing
- Scheduling with variable time slot costs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: Time-of-use scheduling problem with equal-length jobs
