Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness

This publication has 11 references indexed in Scilit:

• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
  International Journal of Production Research, 1996
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
  European Journal of Operational Research, 1994
• Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling
  International Journal of Production Research, 1993
• Performance of priority rules in a due date flow shop
  Omega, 1992
• Flowshop scheduling with set-up, processing and removal times separated
  International Journal of Production Research, 1991
• Flow Shop Problems with Time Lags
  Management Science, 1983
• A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
  Omega, 1983
• An Evaluation of Flow Shop Sequencing Heuristics
  Management Science, 1977
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
  Management Science, 1977
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
  Management Science, 1970