Scheduling a single batch processing machine with non-identical two-dimensional job sizes

作者：

Highlights：

• An MIP for a single batch scheduling with non-identical two-dimensional job sizes.

• New heuristics for job sequencing, batch selection, and job placement.

• Longest-Processing-Time Best-Fit Smallest Area algorithm proven to be the best.

摘要

•An MIP for a single batch scheduling with non-identical two-dimensional job sizes.•New heuristics for job sequencing, batch selection, and job placement.•Longest-Processing-Time Best-Fit Smallest Area algorithm proven to be the best.

论文关键词：Scheduling,Batch processing machines,Heuristics,Two-dimensional job sizes,Mixed integer programming

论文评审过程：Received 2 April 2021, Revised 21 January 2022, Accepted 12 March 2022, Available online 26 March 2022, Version of Record 19 April 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.116907