Skip to main content

Adaptive Scheduling and Control of One-of-a-Kind Production

  • Chapter
  • First Online:
One-of-a-Kind Production
  • 621 Accesses

Abstract

As a typical manufacturing paradigm, one-of-a-kind production (OKP) challenges production scheduling and control differently than mass production. High throughput in OKP is a typical example of mass customization, which is one of the important strategies in the current economy where the objective is to maximize the customer satisfaction by producing highly customized products with near mass production efficiency. As mentioned frequently in this book, OKP is intensely customer focused such that every product is based on specific customer requirements, and products differ on matters of colors, shapes, dimensions, functionalities, materials, processing times, etc. Consequently, a product that is produced on an OKP flow line is rarely repeated.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Blecker T, Friedrich G (eds) (2006) Mass customization: challenges and solutions. Springer, New York

    Google Scholar 

  • Botta-Genoulaz V (2000) Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. Int J Prod Econ 64(1):101–111

    Article  Google Scholar 

  • Brucker P, Drexl A, Mohring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Oper Res 112(1):3–41

    Article  MATH  Google Scholar 

  • Burgess AR, Kilebrew JR (1962) Variation in activity level on a cyclical arrow diagram. J Ind Eng 13:76–83

    Google Scholar 

  • Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n-job, m-machine scheduling problem. Manage Sci 16(10):630–637

    Article  Google Scholar 

  • Framinan JM, Gupta JND, Leisten R (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Oper Res Soc 55(12):1243–1255

    Article  MATH  Google Scholar 

  • Goyal SK, Mehta K, Kodali R, Deshmukh SG (1995) Simulation for analysis of scheduling rules for a flexible manufacturing system. Integr Manuf Syst 6(5):21–26

    Article  Google Scholar 

  • Gupta JND, Stafford EF Jr (2006) Flowshop research after five decades. Eur J Oper Res 169(3):699–711

    Article  MATH  Google Scholar 

  • Herroelen W, De Reyck B, Demeulemeester E (1998) Resource-constrained project scheduling: a survey of recent developments. Comput Oper Res 25(4):279–302

    Article  MathSciNet  MATH  Google Scholar 

  • Johnson DS (1954) Optimal two- and three-stage production schedules with set-up times included. Naval Res Logist Q 1:61–68

    Article  Google Scholar 

  • King JR, Spachis AS (1980) Heuristics for flow-shop scheduling. Int J Prod Res 18(3):345–357

    Article  Google Scholar 

  • Krajewski LJ, Ritzman LP (1999) Master production scheduling: operations management, 5th edn. Addison, Wesley, p 725

    Google Scholar 

  • Kumar VKA, Rajendran CR (1993) Manpower resource levelling in the maintenance of the drill shop computer simulation approach. Int J Model Simul 13:152–155

    Google Scholar 

  • Li W (2006) Adaptive production scheduling and control in one-of-a-kind production. Thesis (M.Sc.), University of Calgary, Canada

    Google Scholar 

  • Li W, Luo XG, Tu YL, Xue D (2007) Adaptive production scheduling for one-of-a-kind production with mass customization. Trans N Am Manuf Res Inst SME 35:41–48

    Google Scholar 

  • Li W, Chang G, Nault RN, Tu YL (2011a) Variation in processing times in one-of-a-kind production: case studies using state space heuristic. In: Proceedings of 39th North American manufacturing research conference, June 13–17, 2011, Corvallis, Oregon, USA, CD-ROM

    Google Scholar 

  • Li W, Nault RN, Xue D, Tu YL (2011b) An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production. Comput Oper Res 38:267–276

    Article  MathSciNet  MATH  Google Scholar 

  • Linn R, Zhang W (1999) Hybrid flowshop scheduling: a survey. Comput Ind Eng 37(1):57–61

    Article  Google Scholar 

  • Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA Int J Manage Sci 11(1):91–95

    Article  Google Scholar 

  • Ovacik IM, Uzsoy R (1997) Decomposition methods for complex factory scheduling problems. Kluwer Academic Publishers, London

    Book  Google Scholar 

  • Park SC, Raman N, Shaw MJ (1997) Adaptive scheduling in dynamic flexible manufacturing systems: a dynamic rule selection approach. IEEE Trans Robot Autom 13(4):486–502

    Article  Google Scholar 

  • Pinedo M (2002) Scheduling theory, algorithms and systems. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Raja K, Kumanan S (2007) Resource levelling using Petrinet and memetic approach. Am J Appl Sci 4(5):317–322

    Article  Google Scholar 

  • Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Oper Res 165(2):479–494

    Article  MathSciNet  MATH  Google Scholar 

  • Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285

    Article  MATH  Google Scholar 

  • Thornton HW, Hunsucker JL (2004) A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. Eur J Oper Res 152(1):96–114

    Article  MathSciNet  MATH  Google Scholar 

  • Tu YL (1996a) A framework for production planning and control in a virtual OKP company. Technical papers of North American Manufacturing Research Institution of SME, pp 121–126

    Google Scholar 

  • Tu YL (1996b) Automatic scheduling and control of a ship welding assembly line. Comput Ind 29(3):169–177

    Article  Google Scholar 

  • Vergara HA, Kim DS (2009) A new method for the placement of buffers in serial production lines. Int J Prod Res 47(16):4437–4456

    Article  MATH  Google Scholar 

  • Wang H (2005) Flexible flow shop scheduling: optimum, heuristic and artificial intelligence solutions. Expert Syst 22(2):78–85

    Article  MATH  Google Scholar 

  • Wortmann JC, Muntslag DR, Timmermans PJM (1997) Customer-driven manufacturing. Chapman & Hall, London

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yiliu Tu .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Tu, Y., Dean, P. (2011). Adaptive Scheduling and Control of One-of-a-Kind Production. In: One-of-a-Kind Production. Springer, London. https://doi.org/10.1007/978-1-84996-531-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-84996-531-6_7

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84996-530-9

  • Online ISBN: 978-1-84996-531-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics