An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
From MaRDI portal
Publication:437051
DOI10.1007/s10878-010-9364-0zbMath1244.90097OpenAlexW1986415048WikidataQ57185654 ScholiaQ57185654MaRDI QIDQ437051
Jiantong Zhang, Chengbin Chu, Feifeng Zheng, Ming Liu
Publication date: 17 July 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9364-0
Related Items
Batch scheduling with deteriorating jobs to minimize the total completion time ⋮ Uniform parallel-machine scheduling with time dependent processing times ⋮ Multi-machine scheduling with interval constrained position-dependent processing times ⋮ Parallel-batch scheduling with two models of deterioration to minimize the makespan ⋮ Batch scheduling with proportional-linear deterioration and outsourcing ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
- Scheduling linear deteriorating jobs with rejection on a single machine
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
- Scheduling jobs under simple linear deterioration
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- Parallel machine scheduling with time dependent processing times
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Due-date assignment and single machine scheduling with deteriorating jobs
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- Single machine scheduling with step-deteriorating processing times
