The Complexity of Flowshop and Jobshop Scheduling

Garey, M. R.; Johnson, D S; Sethi, Ravi

doi:10.1287/moor.1.2.117

Record: found
Abstract: not found
Article: not found

The Complexity of Flowshop and Jobshop Scheduling

Author(s): M. R. Garey , D. S. Johnson , Ravi Sethi

Publication date Created: May 1976

Publication date (Print): May 1976

Journal: Mathematics of Operations Research

Publisher: Institute for Operations Research and the Management Sciences (INFORMS)

Read this article at

ScienceOpenPublisher

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Related collections

Author and article information

Journal

Title: Mathematics of Operations Research

Abbreviated Title: Mathematics of OR

Publisher: Institute for Operations Research and the Management Sciences (INFORMS)

ISSN (Print): 0364-765X

ISSN (Electronic): 1526-5471

Publication date Created: May 1976

Publication date (Print): May 1976

Volume: 1

Issue: 2

Pages: 117-129

Article

DOI: 10.1287/moor.1.2.117

SO-VID: 868db97f-8954-409a-aadb-2abac873a5e5

History

Data availability:

The Complexity of Flowshop and Jobshop Scheduling

Read this article at

Abstract

Related collections

ScienceOpen Research

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 1,920

Cited by 203