New bounds for single-machine time-dependent scheduling with uniform deterioration

DOI10.1016/j.tcs.2024.114673MaRDI QIDQ6562460

Dimitrios Letsios, Kathleen Steinhöfel, Tomasz Radzik, Angelos Gkikas

Publication date: 26 June 2024

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

zbMATH Keywords

release timesapproximation algorithmslinear deteriorationsingle-machine time-dependent scheduling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of scheduling starting time dependent tasks with release times
• Optimal algorithms for online single machine scheduling with deteriorating jobs
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
• Preemptive scheduling with simple linear deterioration on a single machine
• Models and algorithms of time-dependent scheduling
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times
• A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Fatigue, personnel scheduling and operations: review and research opportunities
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• On scheduling with the non-idling constraint

This page was built for publication: New bounds for single-machine time-dependent scheduling with uniform deterioration