scientific article; zbMATH DE number 35511
From MaRDI portal
Publication:3989986
Recommendations
- Semiconductor final-test scheduling under setup operator constraints
- Minimizing L max for the single machine scheduling problem with family set-ups
- A heuristic approach for single-machine scheduling with due dates and class setups.
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- Scheduling of wafer test processes in semiconductor manufacturing
Cited in
(17)- Single-machine scheduling problems with past-sequence-dependent setup times
- Heuristics for capacity planning problems with congestion
- A sequencing problem with family setup times
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
- Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis
- Semiconductor final-test scheduling under setup operator constraints
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
- Scheduling of wafer test processes in semiconductor manufacturing
- Scheduling of multi-spindle CNC gantry mills
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
- Scheduling algorithms for a semiconductor probing facility
- In-house development of scheduling decision support systems: case study for scheduling semiconductor device test operations
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989986)