The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine

Computers and Operations Research

Volumn 26, Issue 7, 1999, Pages 695-698

  Lin, Bertrand M T ^a  

^a MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

FLOWSHOP SCHEDULING;

SCHEDULING;

ALGORITHM; METHODOLOGY;

EID: 0033166747     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00080-X     Document Type: Article

References (3)

1. Oǧzu C, Lin BMT, Cheng TCE. Two-stage flowshop scheduling problem with a common second machine. Computers & Operations Research 1997;76:111-8.
2. Johnson SM. Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1954;1:61-8.
3. Grace MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-completeness. San Francisco: Freeman, 1979.