Batch scheduling with deteriorating jobs to minimize the total completion time

DOI10.1007/S40305-013-0019-6zbMath1277.90051OpenAlexW1969006279MaRDI QIDQ384194

Juan Zou, Cuixia Miao, Yu-Zhong Zhang, Yun-Jie Xia

Publication date: 27 November 2013

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-0019-6

zbMATH Keywords

deteriorating jobsdynamic programming algorithmbatch scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (1)

Mixed batch scheduling on identical machines

Cites Work

• An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Single machine parallel-batch scheduling with deteriorating jobs
• Scheduling a batching machine
• Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
• Scheduling with batching: A review
• Single machine unbounded parallel-batch scheduling with forbidden intervals

This page was built for publication: Batch scheduling with deteriorating jobs to minimize the total completion time