On scheduling with non-increasing time slot cost to minimize total weighted completion time

DOI10.1007/s10951-015-0462-9zbMath1386.90067OpenAlexW2276780023MaRDI QIDQ1702736

Minming Li, Xiangtong Qi, Yingchao Zhao

Publication date: 28 February 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-015-0462-9

zbMATH Keywords

schedulingoperations researchtotal weighted completion timetime slot cost

Mathematics Subject Classification ID

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

Related Items (5)

Calibration scheduling with time slot cost ⋮ Single machine batch scheduling with non-increasing time slot costs ⋮ Time-of-use scheduling problem with equal-length jobs ⋮ 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

• Algorithms for Cost-Aware Scheduling
• Optimal Algorithms and a PTAS for Cost-Aware Scheduling
• `` Strong NP-Completeness Results
• Scheduling with variable time slot costs
• Scheduling

This page was built for publication: On scheduling with non-increasing time slot cost to minimize total weighted completion time