Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints

We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high-volume, discrete maketo-order products. Based on a list scheduling procedure proposed by Kolisch in 1999 we introduce three efficient heuristic solution methods. Namely, a biased random sampling method and two tabu search-based large-step optimization methods. The two latter methods differ in the employed neighbourhood. The first one uses a simple API-neighbourhood while the second one uses a more elaborated so-called 'critical neighbourhood' which makes use of problem insight. All three procedures are assessed on a systematically generated set of test instances. The results indicate that especially the large-step optimization method with the critical neighbourhood gives very good results which are significant better than simple single-pass list scheduling procedures.

[1]  Jae Kyu Lee,et al.  Developing scheduling systems for Daewoo Shipbuilding: DAS project , 1997 .

[2]  Bruce Faaland,et al.  Scheduling Tasks with Due Dates in a Fabrication/Assembly Process , 1987, Oper. Res..

[3]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[4]  Rakesh Nagi,et al.  'Just-in-time' production of large assemblies , 1996 .

[5]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[6]  Wilbert E. Wilhelm,et al.  Optimizing the allocation of components to kits in small‐lot, multiechelon assembly systems , 1994 .

[7]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

[8]  E. W. Davis,et al.  Project Management With Cpm, Pert and Precedence Diagramming , 1983 .

[9]  P. Brucker,et al.  Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem , 1999 .

[10]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[11]  C. Potts,et al.  A branch and bound algorithm for the two-stage assembly scheduling problem , 1997 .

[12]  Bernard W. Taylor,et al.  AN EVALUATION OF SEQUENCING RULES FOR AN ASSEMBLY SHOP , 1985 .

[13]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[14]  Federico Della Croce Di Dojola.  Generalized Pairwise Interchanges and Machine Scheduling , 1995 .

[15]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[16]  Rainer Kolisch,et al.  Assembly scheduling in a make-to-order environment with shop floor constraints , 1996 .

[17]  Jacob Wijngaard,et al.  Complexity and uncertainty of materials procurement in assembly situations , 1996 .

[18]  Rainer Kolisch,et al.  Assembly Management in Machine Tool Manufacturing and the PRISMA-Leitstand , 1996 .

[19]  Andreas Schirmer,et al.  Parameterized heuristics for project scheduling: Biased random sampling methods , 1997 .

[20]  Rakesh Nagi,et al.  Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups , 1997 .

[21]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[22]  Klaus Neumann,et al.  Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production , 1997 .

[23]  Jonathan F. Bard,et al.  Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly , 1995, Oper. Res..

[24]  Rainer Kolisch,et al.  Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies , 2000 .

[25]  Wilbert E. Wilhelm,et al.  An evaluation of heuristics for allocating components to kits in small-lot, multi-echelon assembly systems , 1993 .

[26]  Bruce Faaland,et al.  Cost-Based Scheduling of Workers and Equipment in a Fabrication and Assembly Shop , 1993, Oper. Res..

[27]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[28]  Walter Eversheim,et al.  CIM im Werkzeugmaschinenbau: Der PRISMA-Montageleitstand , 1992 .

[29]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[30]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[31]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .

[32]  Philip M. Wolfe,et al.  Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .

[33]  R. Kolisch,et al.  Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .