Approximation algorithms for parallel machine scheduling with linear deterioration

DOI10.1016/J.TCS.2012.01.020MaRDI QIDQ391224zbMATH OpenOpenAlexFDO

Authors Ming Liu, Feifeng Zheng, Shijin Wang, Yinfeng 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

zbMATH Keywords

approximation algorithmschedulingmakespanparallel machinesimple linear deterioration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Heuristics for parallel machine scheduling with deterioration effect
• An approximation algorithm for parallel machine scheduling with simple linear deterioration
• Parallel-machine scheduling of simple linear deteriorating jobs
• Online makespan scheduling of linear deteriorating jobs on parallel machines
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time

Cites work

• A concise survey of scheduling with time-dependent processing times
• A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
• Due-date assignment and single machine scheduling with deteriorating jobs
• Multi-Machine Scheduling With Linear Deterioration
• Parallel machine scheduling with time dependent processing times
• Parallel-machine scheduling of simple linear deteriorating jobs
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling jobs under simple linear deterioration
• Scheduling linear deteriorating jobs with rejection on a single machine
• Scheduling with time dependent processing times: Review and extensions
• Single machine scheduling with step-deteriorating processing times
• V-Shaped Policies for Scheduling Deteriorating Jobs

Cited in

(11)

• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Heuristics for parallel machine scheduling with deterioration effect
• Coordination mechanisms for scheduling games with proportional deterioration
• Minimizing total load on parallel machines with linear deterioration
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• Parallel-machine scheduling of simple linear deteriorating jobs
• Parallel-machine scheduling with time-dependent and machine availability constraints
• Identical parallel machine scheduling with time-dependent processing times
• An approximation algorithm for parallel machine scheduling with simple linear deterioration
• A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty
• Online makespan scheduling of linear deteriorating jobs on parallel machines

This page was built for publication: Approximation algorithms for parallel machine scheduling with linear deterioration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391224)