Optimal versus heuristic scheduling of surface mount technology lines

Optimal versus heuristic scheduling of surface mount technology lines

0.00 Avg rating0 Votes
Article ID: iaor2005181
Country: United Kingdom
Volume: 42
Issue: 10
Start Page Number: 2083
End Page Number: 2110
Publication Date: Jan 2004
Journal: International Journal of Production Research
Authors: , , ,
Keywords: programming: integer
Abstract:

This paper presents and compares an exact and a heuristic approach for scheduling of printed wiring board assembly in surface mount technology (SMT) lines. A typical SMT line consists of several assembly stations in series and/or in parallel, separated by finite intermediate buffers. The objective of the scheduling problem is to determine the detailed sequencing and timing of all assembly tasks for each individual board, so as to maximize the line's productivity, which is defined in terms of makespan for a mix of board types. The limited intermediate buffers between stations result in a scheduling problem with machine blocking, where a completed board may remain on a machine and block it until a downstream machine becomes available. In addition, limited machine availability due to scheduled downtimes is considered. The exact approach is based on a mixed integer programming formulation that can be used for optimization of assembly schedules by using commercially available software for integer programming, whereas the heuristic approach is designed as a combination of tabu search and a set of dispatching rules. Numerical examples modelled after real-world SMT lines and some computational results are provided to illustrate and compare the two approaches.

Reviews

Required fields are marked *. Your email address will not be published.