An Ant Approach to the Flow Shop Problem

  • Stützle T
  • Intellektik F
  • Informatik F
 et al. 
  • 1


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


In this article we present an ant based approach to Flow Shop Scheduling problems. Ant Colony Optimization is a new algorithmic approach, inspired by the behavior of real ants, that can be used for the solution of combinatorial optimization problems. (Artificial) ants are used to construct solutions for Flow Shop Problems that subsequently are improved by a local search procedure. We compare the results obtained with our procedure to some basic heuristics for Flow Shop Problems, showing that our approach is very promising for the FSP. 1 Introduction The Flow Shop Problem (FSP) can be stated as follows: Each of n jobs 1; : : : ; n have to be processed on m machines 1; : : : ; m in that order. The processing time of job i on machine j is t ij . The processing times are fixed, nonnegative, and may be 0 if a job is not processed on some machine. Further assumptions are that each job can be processed on only one machine at a time, the operations are not preemptable, the jobs are avai...

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Thomas Stützle

  • Fachgebiet Intellektik

  • Fachbereich Informatik

  • Technische Hochschule Darmstadt

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free