Branch and bound algorithm for the flow shop with multiple processors

This publication has 15 references indexed in Scilit:

• Heuristic methods for flexible flow line scheduling
  Journal of Manufacturing Systems, 1987
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
  Operations Research, 1981
• Scheduling and the problem of computational complexity
  Omega, 1979
• On lower bounds in permutation flow shop problems
  International Journal of Production Research, 1979
• Flowshop and Jobshop Schedules: Complexity and Approximation
  Operations Research, 1978
• Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach
  A I I E Transactions, 1977
• Scheduling with earliest start and due date constraints on multiple machines
  Naval Research Logistics Quarterly, 1975
• A Comparative Study of Flow-Shop Algorithms
  Operations Research, 1975
• A Branch-and-Bound Algorithm for Flow Shop Scheduling Problems
  A I I E Transactions, 1970
• Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems
  Operations Research, 1965