Minimizing total completion time of batch scheduling with nonidentical job sizes

DOI10.1007/978-3-319-71150-8_16MaRDI QIDQ1699779zbMATH OpenOpenAlexFDO

Authors Rongqi Li, Zhiyi Tan, Qianyu Zhu

Publication date 26 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71150-8_16

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Batch scheduling of nonidentical job sizes with minsum criteria
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Parallel-machine batch scheduling with non-identical job sizes
• Improved bounds for batch scheduling with nonidentical job sizes
• Minimizing makespan on a single batch processing machine with nonidentical job sizes

Cited in

(5)

• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Improved bounds for batch scheduling with nonidentical job sizes
• Batch scheduling of nonidentical job sizes with minsum criteria
• scientific article; zbMATH DE number 5059917 (Why is no real title available?)
• Batch scheduling with deteriorating jobs to minimize the total completion time

This page was built for publication: Minimizing total completion time of batch scheduling with nonidentical job sizes

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