A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time
From MaRDI portal
Publication:5320231
DOI10.1007/s11741-008-0304-3zbMath1174.90511OpenAlexW1481206255MaRDI QIDQ5320231
Shijie Sun, Ying Yu, Longmin He
Publication date: 22 July 2009
Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11741-008-0304-3
Cites Work
- Unnamed Item
- The time dependent machine makespan problem is strongly NP-complete
- Scheduling jobs under simple linear deterioration
- Complexity of scheduling tasks with time-dependent execution times
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- Scheduling with time dependent processing times: Review and extensions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time