Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
Hi-index | 0.00 |
We present a scheduling procedure for the wire-bonding operation of a semiconductor assembly facility. The wire-bonding operation typically consists of a large number of unrelated parallel machines and is typically one of the bottlenecks in an assembly facility. The scheduling procedure is able to handle setup times, limited fixtures (clamp&paddles) and non-zero machine ready-times (initial work in progress). It is based on a simulator that generates a schedule and a Simulated Annealing approach to optimize the schedule. Some preliminary results from an implementation in a large assembly facility are given.