Modified benders decomposition and metaheuristics for multi-machine parallel-batch scheduling and resource allocation under deterioration effect

• Published in: Computers & industrial engineering Vol. 176; p. 108977
• Main Authors: Jiang, Tao, Lu, Shaojun, Ren, Mingyu, Cheng, Hao, Liu, Xinbao
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.02.2023
• Subjects: Benders decomposition; Deterioration effect; Parallel-batch; Resource allocation; Scheduling; Scheduling; Parallel-batch; Benders decomposition; Deterioration effect; Resource allocation
• ISSN: 0360-8352; 1879-0550
• DOI: 10.1016/j.cie.2023.108977

•A parallel-batch problem considering deterioration effect and resource allocation.•A cutting filtering strategy in Benders Decomposition.•Investigation of the optimal structure for the master problem.•Two hybrid algorithms containing heuristic rules and Variable Neighborhood Search. Batch scheduling problem is a common difficulty in mass production, which includes many decisions such as grouping, batch ordering, and resource allocation. Motivated by the semiconductor burn-in test process, this paper investigates a combinatorial optimization problem considering the deterioration effect and resource allocation. The objective is to design an appropriate job sequencing and resource allocation scheme to achieve an overall minimization of makespan and resource costs. The problem, subject to parallel-batch, multi-machine, deterioration effect, and resource constraints, is NP-hard. We decompose it into a master problem and a sub-problem based on Benders Decomposition (BD). A cut filtering rule that limits the number of cuts is proposed to control the complexity of the problem. Meanwhile, some structural properties are deduced to guide the design of two algorithms combined with Variable Neighborhood Search (VNS). We conduct extensive simulation experiments on instances of different scales, and the results demonstrate that the cut filtering method can effectively reduce the solution time. In large-scale computational experiments, it is more obvious that the proposed algorithms have good convergence and robustness.