Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Yuri N. Sotskov, Natalia V. Shakhlevich. NP-hardness of Shop-scheduling Problems with Three Jobs. Discrete Applied Mathematics, 59(3):237-266, 1995. [doi]
Abstract is missing.