A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing

DOI10.1007/s10951-014-0397-6zbMath1347.90032OpenAlexW2015294321MaRDI QIDQ309050

Abdoul Bitar, Renaud Roussel, Claude Yugma, Stéphane Dauzère-Pérès

Publication date: 7 September 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0397-6

zbMATH Keywords

schedulingparallel machinesmemetic algorithmsemiconductor manufacturingauxiliary resourcessetups

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Unrelated parallel machine scheduling with new criteria: complexity and models ⋮ Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping ⋮ Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times ⋮ Minimizing the sum of completion times on a single machine with health index and flexible maintenance operations ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Parallel machine scheduling with time constraints on machine qualifications ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times ⋮ Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem ⋮ Bi-objective parallel machine scheduling with additional resources during setups ⋮ Production, maintenance and resource scheduling: a review ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem

Cites Work

• Scheduling subject to resource constraints: Classification and complexity
• Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints

This page was built for publication: A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing