Scheduling algorithms for a semiconductor probing facility
From MaRDI portal
Publication:609817
DOI10.1016/j.cor.2010.08.010zbMath1201.90128OpenAlexW1976931273MaRDI QIDQ609817
June-Young Bang, Yeong-Dae Kim
Publication date: 1 December 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.08.010
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Cites Work
- Group shops scheduling with makespan criterion subject to random release dates and processing times
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- Multiple-objective scheduling and real-time dispatching for the semiconductor manufacturing system
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- A tabu search algorithm for parallel machine total tardiness problem
- A backward approach in list scheduling algorithms for multi-machine tardiness problems
- A survey of scheduling problems with setup times or costs
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
- Bottleneck-focused scheduling for a hybrid flowshop
- Scheduling of wafer test processes in semiconductor manufacturing
- The wafer probing scheduling problem (WPSP)
- Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions
This page was built for publication: Scheduling algorithms for a semiconductor probing facility
