Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search

This publication has 14 references indexed in Scilit:

• Climbing depth-bounded discrepancy search for solving hybrid flow shop problems
  European J. of Industrial Engineering, 2007
• Optimal Scheduling of a Two-stage Hybrid Flow Shop
  Mathematical Methods of Operations Research, 2006
• A case study in a two-stage hybrid flow shop with setup time and dedicated machines
  International Journal of Production Economics, 2003
• Variable neighborhood search: Principles and applications
  European Journal of Operational Research, 2001
• Heuristic algorithms for the two-stage hybrid flowshop problem
  Operations Research Letters, 1997
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
  Annals of Operations Research, 1997
• A computational study of heuristics for two-stage flexible flowshops
  International Journal of Production Research, 1996
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
  European Journal of Operational Research, 1996
• Minimizing makespan in hybrid flowshops
  Operations Research Letters, 1994
• Two-Stage, Hybrid Flowshop Scheduling Problem
  Journal of the Operational Research Society, 1988