A GRASP for scheduling printed wiring board assembly

Abstract The assembly of printed wiring boards (PWBs) typically involves the coordination of thousands of components and hundreds of part numbers in a job shop environment with up to 50 different processes and workstations. In this paper we present a greedy randomized adaptive search procedureor GRASP, for solving the daily scheduling problem that is found in such environments. The advantages of the proposed methodology are its ability to respond quickly to changing organizational goals, revised customer requests, and a multitude of shop-floor contingencies. A flexible lot-sizing heuristic with user overrides allows the scheduling algorithm to alter the production strategy in the face of random disturbances, such as machine failures, component stockouts, and demand perturbations. The algorithms, embedded in a decision support system, have been implemented at Texas Instruments' (TI) Austin facility. This facility assembles boards for internal use and for a growing number of external customers. Before imple...

[1]  Uday S. Karmarkar,et al.  Chapter 6 Manufacturing lead times, order release and capacity loading , 1993, Logistics of Production and Inventory.

[2]  Elsayed A. Elsayed,et al.  Job shop scheduling with alternative machines , 1990 .

[3]  T.C.E. Cheng,et al.  Analysis of material flow in a job shop with assembly operations , 1990 .

[4]  Uday S. Karmarkar,et al.  Lot-sizing and sequencing delays , 1987 .

[5]  Jonathan F. Bard,et al.  Reengineering and the development of a decision support system for printed wiring board assembly , 1995 .

[6]  Gabriel R. Bitran,et al.  OR Practice - Development and Implementation of a Scheduling System for a Wafer Fabrication Facility , 1988, Oper. Res..

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

[8]  M. Laguna,et al.  SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH , 1993 .

[9]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[10]  Jonathan F. Bard,et al.  The cutting path and tool selection problem in computer aided process planning , 1989 .

[11]  Li Lin,et al.  COMPOUND DYNAMIC EVENT METAMODELS FOR ELECTRONIC ASSEMBLY LINE SYSTEMS , 1993 .

[12]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

[13]  Jonathan F. Bard,et al.  Flight Scheduling and Maintenance Base Planning , 1989 .

[14]  Michael D. Oliff,et al.  Multiproduct Production Scheduling at Owens-Corning Fiberglas , 1985 .

[15]  Jonathan F. Bard,et al.  Developing a data-collection system for PCB assembly: a case study in software engineering , 1993 .

[16]  Warren B. Powell,et al.  A Turnkey, Microcomputer-Based Logistics Planning System , 1987 .

[17]  Yih-Long Chang,et al.  Schedule generation in a dynamic job shop , 1990 .

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

[19]  Sushil K. Gupta.  n jobs and m machines job-shop problems with sequence-dependent set-up times , 1982 .