Parallel-batch scheduling with rejection: Structural properties and approximation algorithms

• Published in: European journal of operational research Vol. 310; no. 3; pp. 1017 - 1032
• Main Authors: Ou, Jinwen, Lu, Lingfa, Zhong, Xueling
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.11.2023
• Subjects: Approximation algorithm; Parallel-batch; Rejection; Scheduling; Worst-case analysis; Rejection; Worst-case analysis; Scheduling; Parallel-batch; Approximation algorithm
• ISSN: 0377-2217
• DOI: 10.1016/j.ejor.2023.04.019

•Parallel-batch scheduling with dynamic job arrivals and rejection.•Important structural properties are developed and skillfully applied.•A (3−1/b)-approximation algorithm with a complexity of O(nlogn).•An efficient PTAS with a complexity of O(nlogn+Cn). In this paper, we consider a parallel-batch machine scheduling (PBMS) model that unifies several existing scheduling models in the extant literature. In our scheduling model, a given set of jobs with different release dates are scheduled onto a machine that can process multiple jobs simultaneously in a batch. However, the number of jobs in a batch is limited. Each job can be rejected subject to a job-dependent penalty cost, but the total penalty cost of the jobs rejected is required to be no greater than a given bound. The objective is to minimize the weighted sum of the makespan of accepted jobs and the total rejection penalty of rejected jobs. We provide some important structural properties and develop fast approximation algorithms. We also present an efficient polynomial time approximation scheme (EPTAS) with near-linear-time complexity. Our results significantly improve both the time complexities and performance bounds of several existing algorithms and approximation schemes.