Skip to main content
Conference Proceedings

A better approximation for the two-stage assembly scheduling problem with two machines at the first stage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2518 LNCS 199-210
DOI: 10.1007/3-540-36136-7_18
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Karuno, Y., & Nagamochi, H. (2002). A better approximation for the two-stage assembly scheduling problem with two machines at the first stage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 199–210). https://doi.org/10.1007/3-540-36136-7_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free