Skip to main content

Operation sequencing with a single box position

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

Abstract

Let us consider a special case of problem S in the previous chapter to consider the assembly operation or job sequencing problem: with one common box position for all jobs. This covers the practice case where all parts fit into one box or shelf. Then, a walk time optimization needs to decide which of the jobs shall start before the box position, and which after.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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). Operation sequencing with a single box position. In: Time-Dependent Path Scheduling. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-658-28415-2_4

Download citation

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

  • 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