Parallel branch-and-bound methods for thejob-shop scheduling problem

This publication has 11 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
• Simple approaches to parallel Branch and Bound
  Parallel Computing, 1993
• A new lower bound for the job-shop scheduling problem
  European Journal of Operational Research, 1993
• A Computational Study of the Job-Shop Scheduling Problem
  INFORMS Journal on Computing, 1991
• A practical use of Jackson's preemptive schedule for solving the job shop problem
  Annals of Operations Research, 1990
• The Shifting Bottleneck Procedure for Job Shop Scheduling
  Management Science, 1988
• A block approach for single-machine scheduling with release dates and due dates
  European Journal of Operational Research, 1986
• The one-machine sequencing problem
  European Journal of Operational Research, 1982
• Complexity of Machine Scheduling Problems
  1977