Minimizing total completion time of batch scheduling with nonidentical job sizes

DOI10.1007/978-3-319-71150-8_16zbMATH Open1470.90028OpenAlexW2768731780MaRDI QIDQ1699779FDOQ1699779

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

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

Mathematics Subject Classification ID

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

Cited In (5)

• Improved bounds for batch scheduling with nonidentical job sizes
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Batch scheduling of nonidentical job sizes with minsum criteria
• Title not available (Why is that?)
• 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)