Skip to main content

Box placement for multiple product variants

  • Chapter
  • First Online:
Time-Dependent Path Scheduling
  • 306 Accesses

Abstract

Car manufacturers cope with the demand for a variety of product variants often by manufacturing different product variants on the same assembly line (Sternatz, 2014). This extends the classic assembly of a single product to a set of several product variants that are assembled in an intermixed succession. Here, assembly operations can differ between product variants.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Helmut A. Sedding .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Fachmedien Wiesbaden GmbH, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Sedding, H.A. (2020). Box placement for multiple product variants. In: Time-Dependent Path Scheduling. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-658-28415-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-658-28415-2_6

  • Published:

  • Publisher Name: Springer Vieweg, Wiesbaden

  • Print ISBN: 978-3-658-28414-5

  • Online ISBN: 978-3-658-28415-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics