Algorithms for Cost-Aware Scheduling

DOI10.1007/978-3-642-38016-7_17zbMath1394.68047OpenAlexW142814830MaRDI QIDQ2848926

Janardhan Kulkarni, Kamesh Munagala

Publication date: 13 September 2013

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_17

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (7)

Scheduling on a single machine under time-of-use electricity tariffs ⋮ Optimal Algorithms and a PTAS for Cost-Aware Scheduling ⋮ Time-of-use scheduling problem with equal-length jobs ⋮ On scheduling with non-increasing time slot cost to minimize total weighted completion time ⋮ Optimal algorithms for scheduling under time-of-use tariffs ⋮ Scheduling with time-of-use costs ⋮ Polyhedral results for position-based scheduling of chains on a single machine

This page was built for publication: Algorithms for Cost-Aware Scheduling