Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm

Sun, Youbin; Qian, Xiaofei; Liu, Siwen

doi:10.1007/978-3-030-05348-2_40

Cited by 1 publication

(1 citation statement)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Computational results demonstrated the superiority of the proposed MMAS over GA [22]. Sun et al [24] considered deteriorating jobs and module changes simultaneously, they proposed a hybrid algorithm combining self-adaptive differential evolution (SADE) and artificial fish swarm algorithm (AFSA) to tackle the problem. Computational experiments were conducted to evaluate the performance of the proposed algorithm.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Large Neighborhood Search Method for Minimizing Makespan on Unrelated Parallel Batch Processing Machines with Incompatible Job Families

Xin

et al. 2023

Sustainability

View full text Add to dashboard Cite

This paper studies a scheduling problem with non-identical job sizes, arbitrary job ready times, and incompatible family constraints for unrelated parallel batch processing machines, where the batches are limited to the jobs from the same family. The scheduling objective is to minimize the maximum completion time (makespan). The problem is important and has wide applications in the semiconductor manufacturing industries. This study proposes a mixed integer programming (MIP) model, which can be efficiently and optimally solved by commercial solvers for small-scale instances. Since the problem is known to be NP-hard, a hybrid large neighborhood search (HLNS) combined with tabu strategy and local search is proposed to solve large-scale problems, and a lower bound is proposed to evaluate the effectiveness of the proposed algorithm. The proposed algorithm is evaluated on numerous compatible benchmark instances and newly generated incompatible instances. The results of computational experiments indicate that the HLNS outperforms the commercial solver and the lower bound for incompatible problems, while for compatible problems, the HLNS outperforms the existing algorithm. Meanwhile, the comparison results indicate the effectiveness of the tabu and local search strategies.

show abstract

Section: Introductionmentioning

confidence: 99%

A Hybrid Large Neighborhood Search Method for Minimizing Makespan on Unrelated Parallel Batch Processing Machines with Incompatible Job Families

Xin

et al. 2023

Sustainability

View full text Add to dashboard Cite

show abstract

Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm

Cited by 1 publication

References 32 publications

A Hybrid Large Neighborhood Search Method for Minimizing Makespan on Unrelated Parallel Batch Processing Machines with Incompatible Job Families

A Hybrid Large Neighborhood Search Method for Minimizing Makespan on Unrelated Parallel Batch Processing Machines with Incompatible Job Families

Contact Info

Product

Resources

About