A new heuristic method for the flow shop sequencing problem

@inproceedings{Widmer1989ANH,
  title={A new heuristic method for the flow shop sequencing problem},
  author={Marino Widmer and Alain Hertz},
  year={1989}
}
Abstract A new heuristic method is presented for solving the m -machine, n -job flow shop scheduling problem. This method, named spirit , is composed of two phases: the first finds an initial sequence using an analogy with the travelling salesman problem and the second tries to improve this solution using taboo search techniques. The results of the heuristic are compared with those from other well-known methods. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 137 CITATIONS

A Branch and Bound Heuristic for the Flow Shop Problem

  • 2010 Fourth International Conference on Sensor Technologies and Applications
  • 2010
VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Scheduling of multiple in-line steppers for semiconductor wafer fabs

  • Int. J. Systems Science
  • 2014
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Sevast'yanov's Algorithm for the Flow-shop Scheduling Problem

VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1989
2018

CITATION STATISTICS

  • 11 Highly Influenced Citations