Advertisement

Planning and Scheduling in an Assemble-to-Order Environment: Spicer-Off-Highway Products Division

  • Nico J. Vandaele
  • Marc R. Lambrecht
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 42)

Abstract

Spicer Off -Highway Products Division (a division of Dana Corporation) offers their customers a full range of powershift transmissions and torque convertors. The structure of the manufacturing process is typically a hybrid of make-to-stock and make/assemble-to-order. The main problem is that the production lead time for the make parts is substantial due to the large variety of components and the complexity of the production process. Consequently, a large number of manufacturing operations are performed in a highly uncertain environment inevitably resulting in mismatches at the time of the actual customer commitment.

Keywords

Lead Time Setup Time Gantt Chart Detailed Schedule Lead Time Reduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Adams, J., E. Balas, and D. Zawack. (1988) The shifting bottleneck procedure for job-shop scheduling. Management Science, Vol. 34, No. 3, 391–401.CrossRefGoogle Scholar
  2. [2]
    Albin, S.L. (1981) Approximating queues with superposition arrival processes. PhD thesis, Department for Industrial Engineering and Operations Research, Columbia University.Google Scholar
  3. [3]
    Albin, S.L. (1982) Approximating a point process by a renewal process, II: superposition arrival processes to queues. Technical report, Department of industrial engineering, Rutgers University.Google Scholar
  4. [4]
    Applegate, D. and W. Cook. (1991) A computational study of the job-shop scheduling problem. ORSA Journal of Computing, Vol. 3, No. 2, 149–156.CrossRefGoogle Scholar
  5. [5]
    Baker, K.R. (1993) Requirements planning. In S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (Eds.), Logistics of production and inventory, Chapter 11, pp. 571–627, North Holland.Google Scholar
  6. [6]
    Balas, E. (1985) On the facial structure of scheduling polyhedra. Mathematical Programming Study, No. 24, 179–218.CrossRefGoogle Scholar
  7. [7]
    Balas, E., J.K. Lenstra, and A. Vazacopoulos. (1995) The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science, Vol. 41, No. 1, 94–109.CrossRefGoogle Scholar
  8. [8]
    Bitran, G.R. and D. Tirupati. (1988) Multiproduct queueing networks with deterministic routing: decomposition approach and the notion of interference. Management Science, Vol. 34, No. 1, 75–100.Google Scholar
  9. [9]
    Bitran, G.R. and D. Tirupati. (1989) Approximations for product departures from a single-server station with batch processing in multi-product queues. Management Science, Vol. 35, No. 7, 851–878.CrossRefGoogle Scholar
  10. [10]
    Brücker, P., B. Jiirisch, and A. Krämer. (1992) The job shop problem and immediate selection. Technical report, Univ. Osnabrück/Fachbereich Mathematik.Google Scholar
  11. [11]
    Brücker, P., B. Jürisch, and B. Sievers. (1991) A fast branch-and-bound algorithm for the job-shop scheduling problem. Technical report, Univ. Osnabrück/Fachbereich Mathematik.Google Scholar
  12. [12]
    Buzacott, J.A. and J.G. Shantikumar. (1985) On approximate queueing models of dynamic job shops. Management Science, Vol. 31, No. 7, 870–887.CrossRefGoogle Scholar
  13. [13]
    Carlier, J. (1982) The one-machine scheduling problem. European Journal of Operational Research, Vol. 11, 42–47.CrossRefGoogle Scholar
  14. [14]
    Carlier, J. and E. Pinson. (1989) An algorithm for solving the job-shop problem. Management Science, Vol. 35, No. 2, 164–176.CrossRefGoogle Scholar
  15. [15]
    Dauzère-Péres, S. and J.B. Lasserre. (1993) A modified shifting bottleneck procedure for job-shop scheduling. International Journal of Production Research, Vol. 31, No. 4, 923–932.CrossRefGoogle Scholar
  16. [16]
    Ivens, P.L. and M.R. Lambrecht. (1996) Extending the shifting bottleneck procedure to real-life applications. European Journal of Operational Research, Vol. 90, 252–268.CrossRefGoogle Scholar
  17. [17]
    Karmarkar, U.S. (1987) Lot sizes, lead times and in-process inventories. Management Science, Vol. 33, No. 3, 9–423.Google Scholar
  18. [18]
    Karmarkar, U.S., S. Kekre, and S. Kekre. (1992) Multi-item batching heuristics for minimization of queueing delays. European Journal of Operational Research, Vol. 58, 99–111.CrossRefGoogle Scholar
  19. [19]
    Karmarkar, U.S., S. Kekre, and S. Kekre. (1985) Lotsizing in multi-item multi-machine job shops. IIE Transactions, Vol. 17, No. 3, 290–297.CrossRefGoogle Scholar
  20. [20]
    Karmarkar, U.S., S. Kekre, S. Kekre, and S. Freeman. (1985) Lot-sizing and lead-time performance in a manufacturing cell. Interfaces, Vol. 15, No. 2, 1–9.CrossRefGoogle Scholar
  21. [21]
    Kraemer, W. and M. Lagenbach-Belz. (1976) Approximate formulae for the delay in the queueing system GI/GI/1. In Congressbook, pages 235–1 /8, Melbourne, Eighth International Teletraffic Congress.Google Scholar
  22. [22]
    Lageweg, B.J., J.K. Lenstra, and A.H.G. Rinnooy Kan. (1977) Job shop scheduling by implicit enumeration. Management Science, Vol. 24, 441–482.CrossRefGoogle Scholar
  23. [23]
    Lambrecht, M.R., Chen Shaoxiang, and N.J. Vandaele. (1996) A lot sizing model with queueing delays: the issue of safety time. European Journal of Operational Research, Vol. 89, 269–276.CrossRefGoogle Scholar
  24. [24]
    Lambrecht, M.R. and N.J. Vandaele. (1996) A general approximation for the single product lot sizing model with queueing delays. European Journal of Operational Research, Vol. 95, No. 1, 73–88.CrossRefGoogle Scholar
  25. [25]
    Leung, Y. and R. Suri. (1990) Performance evaluation of discrete manufacturing systems. IEEE Control Systems Magazine, Vol. 10, 77–86.CrossRefGoogle Scholar
  26. [26]
    Ivens, P.L., M.R. Lambrecht, and N.J. Vandaele. (1998) Aclips a capacity and lead time integrated procedure for scheduling. Management Science, Vol. 44, No. 11, 1548–1561.Google Scholar
  27. [27]
    Vandaele, N.J., M.R. Lambrecht, R. Cremmery, and N. Schuyter. (2000) Spicer off-highway products division-brugge improves its lead time and scheduling performance. Interfaces, Vol. 30, No. 1, 83–95.CrossRefGoogle Scholar
  28. [28]
    Shantikumar J.G. and J.A. Buzacott. (1980) On the approximations to the single server queue. International Journal of Production Research, Vol. 18, No. 6, 761–773.CrossRefGoogle Scholar
  29. [29]
    Shantikumar, J.G. and J.A. Buzacott. (1981) Open queueing network models of dynamic job shops. International Journal of Production Research, Vol. 19, No. 3, 255–266.CrossRefGoogle Scholar
  30. [30]
    Suri, R. (1989) Lead time reduction through rapid modeling. Manufacturing Systems, Vol. 7, 66–68.Google Scholar
  31. [31]
    Suri, R. and S. Detreville. (1991) Full speed ahead: A look at rapid modeling technology in operations management. OR/MS Today, Vol. 18, 34–42.Google Scholar
  32. [32]
    Suri, R. and S. Detreville. (1992) Rapid modeling: The use of queueing models to support time based competitive manufacturing. In Proceedings of the German/US Conference on Recent Developments in Operations Research, 34–42, Berlin, Springer.Google Scholar
  33. [33]
    Suri, R. and G.W. Diehl. (1985) Manuplan: a precursor to simulation for complex manufacturing systems. In D. Gantz and G. Blais ans S. Solomon, editors, Proceedings of the 1985 Winter Simulation Conference, 411–420. Institute of Electrical and Electronics Engineers.Google Scholar
  34. [34]
    Suri, R., G.W. Diehl, and R. Dean. (1986) Quick and easy manufacturing systems analysis using manuplan. In D. Gantz and G. Blais ans S. Solomon (Eds.), Suri, R., G.W. Diehl, and R. Dean, 195–205, IIE.Google Scholar
  35. [35]
    Suri, R., M. Tomsicek, and D. Derleth. (1990) Manufacturing systems modeling using manuplan and simstarter: a tutorial. In D. Gantz and G. Blais ans S. Solomon (Eds.), Proceedings of the 1990 Winter Simulation Conference, 168–176. IEEE Computer Society Press.Google Scholar
  36. [36]
    Vandaele, N.J. (1996) The impact of lot sizing on queueing delays: multi product, multi machine models. PhD thesis, Department of Applied Economics, Katholieke Universiteit Leuven.Google Scholar
  37. [37]
    Whitt, W. (1983) Performance of the queueing network analyzer. The Bell System Technical Journal, Vol. 62, No. 9, 2817–2843.Google Scholar
  38. [38]
    Whitt, W. (1983) The queueing network analyzer. The Bell System Technical Journal, Vol. 62, No. 9, 2779–2815.Google Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Nico J. Vandaele
    • 1
  • Marc R. Lambrecht
    • 2
  1. 1.University of AntwerpAntwerpBelgium
  2. 2.Katholieke Universiteit LeuvenLeuvenBelgium

Personalised recommendations