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

International Journal of Production Research

Volumn 38, Issue 1, 2000, Pages 207-228

  Kolisch, R ^a   Hess, K ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b Gildemeister Drehmaschinen GmbH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY; CONSTRAINT THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; RESOURCE ALLOCATION; SET THEORY;

MAKE-TO-ORDER ASSEMBLIES;

SCHEDULING;

EID: 0034627935     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/002075400189653     Document Type: Article

References (45)

1. Adelsberger, H.H. and Kanet, J.J., 1991, The leitstand-a new tool for computer-integrated manufacturing. Production and Inventory Management Journal, 1, 43-48.
2. Agrawal, A., Harhalakis, G., Minis, I. and Nagi, R., 1996, 'Just-in-time' production of large assemblies, IIE Transactions, 28, 653-667.
3. Anwar, M.G. and Nagi, R., 1997, Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups. International Journal of Production Research, 35, 1447-1470.
4. Baar, T., Brucker, P. and Knust, S., 1998, Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem. In Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, edited by S. Voss, S. Martello, J. Osmah and C. Roucairol (Dordrecht: Kluwer), pp. 1-8.
5. Baker, K.R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
6. Bixby, N. and Boyd, E., 1996, Using the CPLEX Callable Library (Houston, TX: CPLEX Optimization).
7. Chen, J.F. and Wilhelm, W.E., 1993, An evaluation of heuristics for allocating components to kits in small-lot, multi-echelon assembly systems. International Journal of Production Research, 31, 2835-2856.
8. Chen, J.F. and Wilhelm, W.E., 1994, Optimizing the allocation of components to kits in small-lot, multi-echelon assembly systems. Naval Research Logistics, 41, 229-256.
9. Della Croce, F., 1995, Generalized pairwise interchanges and machine scheduling. European Journal of Operational Research, 83, 310-319.
10. Drexl, A., Eversheim, W., Grempe, R. and Esser, H., 1994, CIM im Werkzeugmaschinenbau-Der PRISMA-Montageteitstand. Zeitschrift für betriebswirt-schaftliche Forschung, 46, 279-295.
11. Drexl, A. and Kolisch, R., 1996, Assembly management in machine tool manufacturing and the PRISMA-Leitstand. Production and Inventory Management Journal, 37, 55-57.
12. Elmaghraby, S.E., 1977, Activity Networks: Project Planning and Control by Network Models (New York: Wiley).
13. Faaland, B. and Schmitt, T., 1987, Scheduling tasks with due dates in a fabrication/assembly process. Operations Research, 35, 378-381.
14. Faaland, B. and Schmitt, T., 1993, Cost-based scheduling of workers and equipment in a fabrication and assembly shop. Operations Research, 41, 253-268.
15. Feo, T.A., Bard, J.F. and Claflin, R.F., 1991, An overview of GRASP methodology and applications. Technical report, Department of Mechanical Engineering, University of Texas at Austin.
16. Feo, T.A., Bard, J.F. and Holland, S.D., 1995, Facility-wide planning and scheduling of printed wiring board assembly. Operations Research, 43, 219 230.
17. Fourer, R., Gay, D.M. and Kernighan, B.W., 1993, AMPL-A Modeling Language for Mathematical Programming (Danvers: Boyd & Fraser).
18. Glover, F., 1989, Tabu search-Part I. ORSA Journal on Computing, 1, 190-206.
19. Glover, F., 1990, Tabu search-Part II. ORSA Journal on Computing, 2, 4-32.
20. Hariri, A.M.A. and Potts, C.N., 1997, A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research, 103, 547-556.
21. Hartmann, S., 1998, A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics, 45, 733-750.
22. Kolisch, R., 1995, Project Scheduling Under Resource Constraints-Efficient Heuristics for Several Problem Classes (Heidelberg: Physica).
23. Kolisch, R., 1996, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 90, 320-333.
24. Kolisch, R., 1999, Integrated scheduling, assembly area-, and part-assignment for large scale make-to-order assemblies. International Journal of Production Economics, to be published.
25. Kolisch, R. and Hartmann, S., 1999, Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. In: Project Scheduling-Recent Models, Algorithms and Applications, edited by J. Weglarz (Dordrecht: Kluwer) pp. 147-178.
26. Kolisch, R. and Rinne, A., 1996, Assembly scheduling in a make-to-order environment with shop floor constraints. Symposium on Operations Research, edited by P. Kleinschmidt, A. Bachem, U. Derigs, D. Fischer, U. Leopold-Wildburger, and R.H. Möhring (Berlin: Springer) pp. 376-381.
27. Kolisch, R., Sprecher, A. and Drexl, A., 1995, Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 41, 1693-1703.
28. Lalsare, P. and Sen, S., 1995, Evaluating backward scheduling and sequencing rules for an assembly shop environment. Production and Inventory Management Journal, 36, 71-77.
29. Lee, C.-Y., Cheng, T.C.E. and Lin, B.M.T., 1993, Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science, 39, 616-625.
30. Lee, J.K., Lee, K.J., Park, H.K., Hong, J.S. and Lee, J.S., 1997, Developing scheduling systems for Daewoo shipbuilding: DAS project. European Journal of Operational Research, 97, 380-395.
31. Lourencco, H.R., 1995, Job-shop scheduling: computational study of local search and large-step optimization methods. European Journal of Operational Research, 83, 347-364.
32. Martin, O., Otto, S.W. and Felten, E.W., 1992, Large-step markov chains for TSP incorporating local search heuristics. Operations Research Letters, 11, 219-224.
33. Moder, J.J., Phillips, C.R. and Davis, E.W., 1983, Project Management with CPM, PERT and Precedence Diagramming third edition (New York: Van Nostrand-Reinhold).
34. Neumann, K. and Schwindt, C., 1997, Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production. OR Spektrum, 19, 205-217.
35. Nof, S.Y., Wilhelm, W.E. and Warnecke, H.-J., 1997, Industrial Assembly (London: Chapman & Hall).
36. Panwalkar, S.S. and Iskander, W., 1977, A survey of scheduling rules. Operations Research, 25, 45-61.
37. Petersen, U., 1992, Produktionsplanung und Belegung von montageflächen (Wiesbaden: Gabler).
38. Pinedo, M., 1995, Scheduling-Theory, Algorithms, and Systems (Englewood Cliffs, NJ: Prentice Hall).
39. Potts, C.N., Sevastjanov, S.E., Strusevich, V.A., Van Wassenhove, L.N. and Zwaneveld, C.M., 1995, The two-stage assembly scheduling problem: Complexity and approximation. Operations Research, 43, 346-355.
40. Pritsker, A.A.B., Watters, L.J. and Wolfe, P.M., 1969, Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 16, 93-107.
41. Russell, R.S. and Taylor, B.W. III, An evaluation of sequencing rules for an assembly shop. Decision Sciences, 16, 196-212, 1985.
42. Schirmer, A. and Riesenberg, S., 1997, Parameterized heuristics for project scheduling-biased random sampling methods. Technical Report 456, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel.
43. Schlauch, R. and Ley, W., 1988, Flächenorientierte Terrain- und Kapazitätsplanung in der Anlagemnontage. Zeitschrift für wirtschaftliche Fertigung, 83, 223-227.
44. Schutten, J.M.J., 1996, List scheduling revisited. Operations Research Letters, 18, 167-170.
45. Van Der Vaart, J.T., De Eries, J. and Wijngaard, J., 1996, Complexity and uncertainty of materials procurement in assembly situations. International Journal of Production Ecohomics, 46-47, 137-152.