Scheduling with time-dependent execution times
From MaRDI portal
Publication:673610
DOI10.1016/0020-0190(95)00011-ZzbMath0875.68422OpenAlexW2008132520MaRDI QIDQ673610
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00011-z
Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs ⋮ An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan ⋮ Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Greedy solutions of selection and ordering problems ⋮ Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
Cites Work
This page was built for publication: Scheduling with time-dependent execution times
