Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Algorithms and Computation

WALCOM 2018: WALCOM: Algorithms and Computation pp 119–131Cite as

Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10755))

Abstract

The paper presents a Lagrangian relaxation based algorithm for scheduling jobs in the two-stage flowshop where the first stage is comprised of several parallel identical machines and the second stage consists of a single machine processing jobs in the predefined batches. Motivated by applications where unloading and loading occur when the means of transportation are changed, the processing of the jobs, constituting a batch, can commence only if this batch has been allocated a portion of a limited buffer associated with the flowshop. This portion varies from batch to batch and is released only after the completion of the batch processing on the second stage machine. Each batch has a due date and the objective is to minimise the total weighted tardiness. The effectiveness of the proposed algorithm is demonstrated by computational experiments.

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

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Brucker, P., Knust, S.: Complex Scheduling. GOR-Publications. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-23929-8

    Book  MATH  Google Scholar 

  2. Emmons, H., Vairaktarakis, G.: Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-5152-5

    Book  Google Scholar 

  3. Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 50(12), 1861–1871 (2004)

    Article  Google Scholar 

  4. Fung, J., Zinder, Y.: Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2), 153–157 (2015)

    Article  MathSciNet  Google Scholar 

  5. Fung, J., Singh, G., Zinder, Y.: Capacity planning in supply chains of mineral resources. Inf. Sci. 316, 397–418 (2015)

    Article  Google Scholar 

  6. Garey, M., Johnson, D., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gu, H., Memar, J., Zinder, Y.: Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. In: IWOCA 2017 Proceedings. LNCS (2017, accepted)

    Google Scholar 

  8. Kononov, A., Hong, J.-S., Kononova, P., Lin, F.-C.: Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications. J. Sched. 15(4), 487–497 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kononova, P.A., Kochetov, Y.A.: The variable neibourhood search for two machine flowshop problem with passive prefetch. J. Appl. Ind. Math. 19(5), 63–82 (2013)

    MATH  Google Scholar 

  10. Lin, F.-C., Hong, J.-S., Lin, B.M.T.: A two-machine flowshop problem with processing time-dependent buffer constraints - an application in multimedia presentations. Comput. Oper. Res. 36(4), 1158–1175 (2009)

    Article  MATH  Google Scholar 

  11. Lin, F.-C., Hong, J.-S., Lin, B.M.T.: Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries. Inf. Syst. 38(1), 82–96 (2013)

    Article  Google Scholar 

  12. Lin, F.-C., Lai, C.-Y., Hong, J.-S.: Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries. Data Knowl. Eng. 66(3), 382–401 (2008)

    Article  Google Scholar 

  13. Lin, F.-C., Lai, C.-Y., Hong, J.-S.: Heuristic algorithms for ordering media objects to reduce presentation lags in auto-assembled multimedia presentations from digital libraries. Electron. Libr. 27(1), 134–148 (2009)

    Article  Google Scholar 

  14. Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, New York (2012). https://doi.org/10.1007/978-1-4614-2361-4

    Book  MATH  Google Scholar 

  15. Witt, A., Voß, S.: Simple heuristics for scheduling with limited intermediate storage. Comput. Oper. Res. 34(8), 2293–2309 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Technology Sydney, PO Box 123, Broadway, NSW, 2007, Australia

    Hanyu Gu, Julia Memar & Yakov Zinder

Authors
  1. Hanyu Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julia Memar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yakov Zinder
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julia Memar .

Editor information

Editors and Affiliations

  1. Bangladesh University of Engineering and Technology, Dhaka, Bangladesh

    M. Sohel Rahman

  2. National University of Singapore , Singapore, Singapore

    Wing-Kin Sung

  3. Japan Advanced Institute of Science and Technology, Ishikawa, Japan

    Ryuhei Uehara

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gu, H., Memar, J., Zinder, Y. (2018). Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach. In: Rahman, M., Sung, WK., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2018. Lecture Notes in Computer Science(), vol 10755. Springer, Cham. https://doi.org/10.1007/978-3-319-75172-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75172-6_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75171-9

  • Online ISBN: 978-3-319-75172-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation