Skip to main content
SpringerLink
Log in

A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags

  • Conference paper
Algorithms and Computation (ISAAC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2906))

Included in the following conference series:

Abstract

In this paper we consider the two-machine flowshop scheduling problem with time lags. The problem has been known to be strongly NP-hard and 2-approximation algorithms have been obtained. We give a (11/6)-approximation algorithm that runs in O(nlogn) time for an instance with n jobs.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as 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

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.

References

  1. Association of Mechanical Technology of Japan (ed.): A Collection of FMS’s in Japan. Machinist Publisher, Tokyo (1982) (in Japanese)

    Google Scholar 

  2. Brucker, P.: Scheduling Algorithms, 3rd edn. Springer, Berlin (2001)

    MATH  Google Scholar 

  3. Dell’Amico, M.: Shop problems with two machines and time lags. Operations Research 44, 777–787 (1996)

    Article  MATH  Google Scholar 

  4. Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1, 61–68 (1954)

    Article  Google Scholar 

  5. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds.) Handbooks in Operations Research and Management Science. Logistics of Production and Inventory, vol. 4, pp. 445–522. Elsevier, Amsterdam (1993)

    Google Scholar 

  6. Mitten, L.G.: Sequencing n jobs on two machines with arbitrary time lags. Management Science 5, 293–297 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  7. Strusevich, V.A.: A heuristic for the two-machine open-shop scheduling problem with transportation times. Discrete Applied Mathematics 93, 287–304 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kyoto Institute of Technology, Sakyo, Kyoto, 606-8585, Japan

    Yoshiyuki Karuno

  2. Toyohashi University of Technology, Toyohashi, Aichi, 441-8580, Japan

    Hiroshi Nagamochi

Authors
  1. Yoshiyuki Karuno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Science and Technology, Kwansei Gakuin University, Sanda, Japan

    Toshihide Ibaraki

  2. Department of Architecture and Architectural Engineering, Kyoto University, 615-8540, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  3. Department of Computer Science and Communication Engineering, Kyushu University, 812-8581, Fukuoka, Japan

    Hirotaka Ono

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karuno, Y., Nagamochi, H. (2003). A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24587-2_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20695-8

  • Online ISBN: 978-3-540-24587-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation