This paper addresses the optimization of a sorting system encountered in the semiconductor industry. Thesystem consists of parallel sorting machines and a material handler to transport materials to, from andbetween machines. The problem is decomposed into multiple subproblems. For each of these subproblemsheuristic methods are proposed. A discrete-event simulation is used to study the performance of thesystem using these heuristics. Application on two real-world cases shows that this heuristic approach cansignificantly decrease the makespan and cost, yielding practically feasible schedules.
|Title of host publication||WSC 2020 - 2020 Winter Simulation Conference|
|Editors||K.H. Bae, B. Feng, S. Kim, S. Lazarova-Molnar, Z. Zheng, T. Roeder, R. Thiesing|
|Publication status||Published - Dec 2020|