Sequencing a generalized two-stage flowshop with finite intermediate storage

This publication has 26 references indexed in Scilit:

• Flowshop scheduling with limited temporary storage
  Journal of the ACM, 1980
• Complexity of Scheduling Shops with No Wait in Process
  Mathematics of Operations Research, 1979
• A General Bounding Scheme for the Permutation Flow-Shop Problem
  Operations Research, 1978
• Complexity of Scheduling under Precedence Constraints
  Operations Research, 1978
• Complexity of Machine Scheduling Problems
  Published by Elsevier ,1977
• The Complexity of Flowshop and Jobshop Scheduling
  Mathematics of Operations Research, 1976
• A Comparative Study of Flow-Shop Algorithms
  Operations Research, 1975
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• A Branch-and-Bound Algorithm for Flow Shop Scheduling Problems
  A I I E Transactions, 1970
• Optimal two‐ and three‐stage production schedules with setup times included
  Naval Research Logistics Quarterly, 1954