Two branch and bound algorithms for the permutation flow shop problem

This publication has 14 references indexed in Scilit:

• Adjustment of heads and tails for the job-shop problem
  European Journal of Operational Research, 1994
• A branch and bound algorithm for the job-shop scheduling problem
  Discrete Applied Mathematics, 1994
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
  Management Science, 1993
• The two-machine flow shop problem with arbitrary precedence relations
  European Journal of Operational Research, 1993
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
  Management Science, 1992
• A practical use of Jackson's preemptive schedule for solving the job shop problem
  Annals of Operations Research, 1990
• An Algorithm for Solving the Job-Shop Problem
  Management Science, 1989
• The one-machine sequencing problem
  European Journal of Operational Research, 1982
• An adaptive branching rule for the permutation flow-shop problem
  European Journal of Operational Research, 1980
• A General Bounding Scheme for the Permutation Flow-Shop Problem
  Operations Research, 1978