Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility
From MaRDI portal
Publication:4497252
Recommendations
- Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing
- Analysis and evaluation of an assemble-to-order system with batch ordering policy and compound Poisson demand
- Benchmarking non-first-come-first-served component allocation in an assemble-to-order system
- Make-to-order scheduling in foundry semiconductor fabrication
- Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching
- Capacity planning with reconfigurable kits in semiconductor test manufacturing
- Optimal and heuristic policies for assemble-to-order systems with different review periods
- An optimised dynamic bottleneck dispatching policy for semiconductor wafer fabrication
- Optimization of industrial-scale assemble-to-order systems
Cited in
(7)- Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing
- Heuristic approaches for master planning in semiconductor manufacturing
- A rolling horizon planning approach for short-term demand supply matching
- Semiconductor lot allocation using robust optimization
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
- Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times
- Bin covering algorithms in the second stage of the lot to order matching problem
This page was built for publication: Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4497252)
