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

DOI10.1007/S10951-015-0462-9zbMATH Open1386.90067OpenAlexW2276780023MaRDI QIDQ1702736FDOQ1702736

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

Recommendations

• Scheduling with variable time slot costs
• Optimal algorithms and a PTAS for cost-aware scheduling
• Single machine batch scheduling with non-increasing time slot costs
• One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times
• Scheduling start time dependent jobs to minimize the total weighted completion time

zbMATH Keywords

operations researchschedulingtotal 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)

Cites Work

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

Cited In (6)

• Scheduling with variable time slot costs
• Time-of-use scheduling problem with equal-length jobs
• Calibration scheduling with time slot cost
• Single machine batch scheduling with non-increasing time slot costs
• Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs
• Polyhedral results for position-based scheduling of chains on a single machine

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702736)