Ant colony optimization technique for the sequence-dependent flowshop scheduling problem

This publication has 29 references indexed in Scilit:

• A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods
  Computers & Industrial Engineering, 2008
• A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
  Journal of the Operational Research Society, 2006
• Ant colony optimization: Introduction and recent trends
  Physics of Life Reviews, 2005
• Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time
  Computers & Industrial Engineering, 2004
• Two MILP models for the N × M SDST flowshop sequencing problem
  International Journal of Production Research, 2001
• Scheduling problem in a two-machine flow line with theN-step prior-job-dependent set-up times
  International Journal of Systems Science, 2001
• Scheduling flowshops with finite buffers and sequence-dependent setup times
  Computers & Industrial Engineering, 1999
• On the Srikar-Ghosh MILP model for the iVx M SDST flowshop problem
  International Journal of Production Research, 1990
• A MILP model for the n -job, M -stage flowshop with sequence dependent set-up times
  International Journal of Production Research, 1986
• Optimal two‐ and three‐stage production schedules with setup times included
  Naval Research Logistics Quarterly, 1954