Approximation algorithms for parallel machine scheduling with linear deterioration
From MaRDI portal
Publication:391224
DOI10.1016/j.tcs.2012.01.020zbMath1416.68208OpenAlexW1970199928MaRDI QIDQ391224
Feifeng Zheng, Ming Liu, Shijin Wang, Yin-Feng Xu
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.020
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Parallel-machine scheduling with time-dependent and machine availability constraints ⋮ A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty ⋮ Coordination mechanisms for scheduling games with proportional deterioration ⋮ Identical parallel machine scheduling with time-dependent processing times
Cites Work
- Parallel-machine scheduling of simple linear deteriorating jobs
- 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 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
- Multi-Machine Scheduling With Linear Deterioration
- Single machine scheduling with step-deteriorating processing times
