Single-machine makespan minimization scheduling with nonlinear shortening processing times
From MaRDI portal
Publication:1762019
DOI10.1016/j.cor.2011.05.001zbMath1251.90199OpenAlexW2010100426MaRDI QIDQ1762019
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.001
Cites Work
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Batch scheduling of step deteriorating jobs
- Time-dependent scheduling
- Scheduling jobs under decreasing linear deterioration
- A concise survey of scheduling with time-dependent processing times
- A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- Scheduling with time dependent processing times: Review and extensions
- Minimizing Variation of Flow Time in Single Machine Systems
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Single-machine makespan minimization scheduling with nonlinear shortening processing times