Uniform parallel-machine scheduling with time dependent processing times

DOI10.1007/s40305-013-0014-yzbMath1334.90058OpenAlexW1986200636MaRDI QIDQ457550

Juan Zou, Yu-Zhong Zhang, Cuixia Miao

Publication date: 29 September 2014

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-013-0014-y

zbMATH Keywords

schedulinguniform machinefully polynomial time approximation schemelinear deterioration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• An FPTAS for uniform machine scheduling to minimize makespan with 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
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• Algorithms for Scheduling Independent Tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Techniques for scheduling with rejection
• Algorithms and Data Structures