Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems

In this paper, we analyse the operational planning problem in an electronic assembly system with multiple placement machines operating in parallel. The partial setup strategy is proposed as an effective methodology for this problem. This strategy attempts to determine the balance between processing time and changeover time during system operation. The Tour primary issues are determining the assignment of products to machines, the sequence of products on each machine, the assignment of components to feeder locations for each product, and the component placement sequence for each product. Four solution procedures for unique and partial setup strategies are developed and tested. The computation results show that for low to medium volume high mix environments, the partial setup procedures offer significant improvement over the unique setup strategies. The results also show that no single fixed strategy dominates in all scenarios, and therefore, an adaptable procedure that will choose the best solution for eac...

[1]  Kut C. So,et al.  Some heuristics for scheduling jobs on parallel machines with setups , 1990 .

[2]  J. Rajgopal,et al.  On scheduling parallel machines with two setup classes , 1991 .

[3]  Linus E. Schrage.  LINDO : an optimization modeling system , 1991 .

[4]  Christopher S. Tang,et al.  Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches , 1988, Oper. Res..

[5]  Brett A. Peters,et al.  Replanning and analysis of partial setup strategies in printed circuit board assembly systems , 1996 .

[6]  Robert J. Wittrock,et al.  Scheduling parallel machines with major and minor setup times , 1990 .

[7]  Richard H. Deane,et al.  Balancing Workloads and Minimizing Set-up Costs in the Parallel Processing Shop , 1975 .

[8]  Thomas L. Landers,et al.  A heuristic algorithm for minimizing total production time for a sequence of jobs on a surface mount placement machine , 1993 .

[9]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[10]  Christopher S. Tang.  Scheduling batches on parallel machines with major and minor set-ups , 1990 .

[11]  Arthur M. Geoffrion,et al.  Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach , 1976, Oper. Res..

[12]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .

[13]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[14]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[15]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[16]  Leon F. McGinnis,et al.  AUTOMATED PROCESS PLANNING FOR PRINTED CIRCUIT CARD ASSEMBLY , 1992 .

[17]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[18]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.