Calibration scheduling with time slot cost

DOI10.1016/j.tcs.2020.03.018zbMath1436.90058OpenAlexW3014711981MaRDI QIDQ2173297

Yanyan Li

Publication date: 22 April 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.03.018

zbMATH Keywords

schedulingdynamic programmingcalibrationoptimal algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (7)

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 ⋮ Scheduling with variable-length calibrations: two agreeable variants ⋮ Scheduling many types of calibrations ⋮ Minimizing the cost of batch calibrations ⋮ Calibrations scheduling with arbitrary lengths and activation length

Cites Work

• Unnamed Item
• Algorithmic aspects in information and management. 12th international conference, AAIM 2018, Dallas, TX, USA, December 3--4, 2018. Proceedings
• On scheduling with non-increasing time slot cost to minimize total weighted completion time
• Optimal Algorithms and a PTAS for Cost-Aware Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Speed is as powerful as clairvoyance
• On the Complexity of Minimizing the Total Calibration Cost
• Scheduling with variable time slot costs
• Transversals and matroid partition

This page was built for publication: Calibration scheduling with time slot cost