The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times

DOI10.1016/S0898-1221(98)00099-6zbMath0992.90027OpenAlexW2012916760MaRDI QIDQ1608433

Qing Ding, Cheng, T. C. Edwin

Publication date: 6 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00099-6

zbMATH Keywords

computational complexityschedulingsingle machinemakespansequencingtime-dependence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

The complexity of scheduling starting time dependent tasks with release times ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Single machine scheduling with step-deteriorating processing times ⋮ The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times ⋮ Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

Cites Work

• Complexity of scheduling tasks with time-dependent execution times
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
• Unnamed Item

This page was built for publication: The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times