Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2002: Algorithms and Computation pp 199–210Cite as

A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage

  • Conference paper
  • First Online:

  • 987 Accesses

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

Abstract

In this paper, we consider the two-stage assembly scheduling problem with two machines at the first stage. The problem has been known to be strongly NP-hard and a 1.5-approximation algorithm has been obtained. We give a 1.37781-approximation algorithm that runs in O(n2 log n) time for an instance with n jobs.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hariri, A. M. A. and Potts, C. N.: A branch and bound algorithm for the two-stage assembly scheduling problem, European Journal of Operational Research 103 (1997) 547–556

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  3. Lee, C.-Y., Cheng, T. C. E. and Lin, B. M. T.: Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem, Management Science 39 (1993) 616–625

    Article  MATH  Google Scholar 

  4. Potts, C. N., Sevast’janov, S. V., Strusevich, V. A., Van Wassenhove, L. N. and Zwaneveld, C. M.: The two-stage assembly scheduling problem: Complexity and approximation, Operations Research 43 (1995) 346–355

    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 Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karuno, Y., Nagamochi, H. (2002). A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation