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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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
Johnson, S. M.: Optimal two-and three-stage production schedules with setup times included, Naval Research Logistics Quarterly 1 (1954) 61–68
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
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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