Scheduling jobs that arrive over time

DOI10.1007/3-540-60220-8_53zbMath1502.68371OpenAlexW1539141971MaRDI QIDQ5057424

Clifford Stein, Joel M. Wein, Cynthia A. Phillips

Publication date: 16 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60220-8_53

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items

Optimally competitive list batching, Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope, Decomposition Algorithm for the Single Machine Scheduling Polytope, An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem, From preemptive to non-preemptive speed-scaling scheduling, A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds, Optimal on-line algorithms for single-machine scheduling, On-line single-server dial-a-ride problems, On-line scheduling of parallel machines to minimize total completion times, New results on competitive analysis of online SRPT scheduling, On-line booking policies and competitive analysis of medical examination in hospital

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling with Deadlines and Loss Functions
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Open Shop Scheduling to Minimize Finish Time
• Scheduling independent tasks to reduce mean finishing time
• Task scheduling in networks
• Technical Note—Minimizing Average Flow Time with Parallel Machines