Scheduling with variable time slot costs

DOI10.1002/nav.20393zbMath1206.90050OpenAlexW1996431910MaRDI QIDQ5189246

Xiangtong Qi, Guohua Wan

Publication date: 15 March 2010

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20393

zbMATH Keywords

schedulingpolynomial time algorithmNP-hardnesstime slot cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (16)

Scheduling on a single machine under time-of-use electricity tariffs ⋮ Approximate dynamic programming for an energy-efficient parallel machine scheduling problem ⋮ Acquisition planning and scheduling of computing resources ⋮ Calibration scheduling with time slot cost ⋮ Optimal Algorithms and a PTAS for Cost-Aware Scheduling ⋮ Single machine batch scheduling with non-increasing time slot costs ⋮ Time-of-use scheduling problem with equal-length jobs ⋮ Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey ⋮ Energy cost efficient scheduling in flexible job-shop manufacturing systems ⋮ On scheduling with non-increasing time slot cost to minimize total weighted completion time ⋮ Production scheduling with subcontracting: the subcontractor's pricing game ⋮ Optimal algorithms for scheduling under time-of-use tariffs ⋮ Scheduling with time-of-use costs ⋮ Single-machine scheduling with an external resource ⋮ Polyhedral results for position-based scheduling of chains on a single machine ⋮ Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine flow-time scheduling with scheduled maintenance
• Batching deteriorating items with applications in computer communication and reverse logistics
• A concise survey of scheduling with time-dependent processing times
• Scheduling with limited machine availability
• The learning effect: getting to the core of the problem
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• A state-of-the-art review on scheduling with learning effects
• Scheduling Commercials on Broadcast Television
• `` Strong NP-Completeness Results
• Complexity results for single-machine scheduling with positional learning effects

This page was built for publication: Scheduling with variable time slot costs