Journal ArticleOPEN ACCESS

The Three-Machine No-Wait Flow Shop is NP-Complete

Journal of the ACM (JACM) (1984) 31(2) 336-345
DOI: 10.1145/62.65
205Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

Abstract

The three-machine, minimum makespan, permutation flow shop with no walt in process Is shown to be NP-hard in the strong sense. TMs settles a well-known open question m scheduling theory. © 1984, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Röck, H. (1984). The Three-Machine No-Wait Flow Shop is NP-Complete. Journal of the ACM (JACM), 31(2), 336–345. https://doi.org/10.1145/62.65

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