A very fast TS/SA algorithm for the job shop scheduling problem

@article{Zhang2008AVF,
  title={A very fast TS/SA algorithm for the job shop scheduling problem},
  author={Chaoyong Zhang and Peigen Li and Yunqing Rao and Zailin Guan},
  journal={Computers & OR},
  year={2008},
  volume={35},
  pages={282-294}
}
The job shop scheduling problem (JSP) is one of the most notoriously intractable NP-complete optimization problems. Over the last 10–15 years, tabu search (TS) has emerged as an effective algorithmic approach for the JSP. However, the quality of solutions found by tabu search approach depends on the initial solution. To overcome this problem and provide a robust and efficient methodology for the JSP, the heuristics search approach combining simulated annealing (SA) and TS strategy is developed… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 164 citations. REVIEW CITATIONS

8 Figures & Tables

Topics

Statistics

010203020082009201020112012201320142015201620172018
Citations per Year

165 Citations

Semantic Scholar estimates that this publication has 165 citations based on the available data.

See our FAQ for additional information.