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

DOI10.1007/S10951-014-0397-6MaRDI QIDQ309050zbMATH OpenOpenAlexFDO

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

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

schedulingsemiconductor manufacturingparallel machinesauxiliary resourcesmemetic algorithmsetups

Mathematics Subject Classification ID

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

Recommendations

• Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem
• Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids
• A multi-objective memetic algorithm for the job-shop scheduling problem
• Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
• A memetic algorithm for the total tardiness single machine scheduling problem
• A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
• Novel multi objective evolutionary algorithms for unrelated parallel machine scheduling problems

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

Cited in

(13)

• Production, maintenance and resource scheduling: a review
• Parallel machine scheduling with time constraints on machine qualifications
• Unrelated parallel machine scheduling with new criteria: complexity and models
• On the exact solution of a large class of parallel machine scheduling problems
• Bi-objective parallel machine scheduling with additional resources during setups
• Minimizing the sum of completion times on a single machine with health index and flexible maintenance operations
• Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
• 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
• Iterated greedy algorithms for a complex parallel machine scheduling problem
• Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
• A simulation optimization framework to solve stochastic flexible job-shop scheduling problems -- case: semiconductor manufacturing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309050)