Skip to main content

Abstract

We consider a flexible flow shop rescheduling problem with transporters that carry heavy cargoes from a manufacturing site to loading docks. If a transporter is occupied by a heavy cargo, it cannot transport other heavy cargo until the operation at the last stage of the dedicated heavy cargo is completed. This imposes resource constraints for transporters that are practically relevant in heavy cargo logistics. We also consider stage skipping, resource eligibility constraints, sequence-dependent relocation time on transporters, and available time intervals of resources. Assuming that an initial schedule is given, we propose a mixed-integer (linear) programming model for a scheduling problem with multiple objectives including makespan and several rescheduling objectives.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Elmi, A., Topaloglu, S.: A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots. Comput. Oper. Res. 40(10), 2543–2555 (2013)

    Article  MathSciNet  Google Scholar 

  2. He, X., Dong, S., Zhao, N.: Research on rush order insertion rescheduling problem under hybrid flow shop based on NSGA-III. Int. J. Prod. Res. 58(4), 1161–1177 (2020)

    Article  Google Scholar 

  3. Lei, C., Zhao, N., Ye, S., Wu, X.: Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times. Comput. Ind. Eng. 139, 105984 (2020)

    Article  Google Scholar 

  4. Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 5th edn. Springer, Cham (2016). https://doi.org/10.1007/978-3-642-46773-8_5

    Book  MATH  Google Scholar 

  5. Ruiz, R., Vázquez-Rodríguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1–18 (2010)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This paper was supported by the National IT Industry Promotion Agency of Korea (NIPA) funded by the Ministry of Science and Information and Communications Technology of Korea (MSIT). (Grants: S1510-22-1001(001))

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kangbok Lee .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Moon, K., Lee, M., Lee, K. (2022). Rescheduling Problem for Heavy Cargo Logistics with Transporters. In: Kim, D.Y., von Cieminski, G., Romero, D. (eds) Advances in Production Management Systems. Smart Manufacturing and Logistics Systems: Turning Ideas into Action. APMS 2022. IFIP Advances in Information and Communication Technology, vol 663. Springer, Cham. https://doi.org/10.1007/978-3-031-16407-1_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-16407-1_57

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-16406-4

  • Online ISBN: 978-3-031-16407-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics