Tabu search for the job-shop scheduling problem with multi-purpose machines *

@inproceedings{Hurink2005TabuSF,
  title={Tabu search for the job-shop scheduling problem with multi-purpose machines *},
  author={Johann Hurink and Bernd Jurisch and M. Thole},
  year={2005}
}
Abstract. In this paper we study the following generalization of the job-shop scheduling problem. Each operation can be performed by one machine out of a set of machines given for this operation. The processing time does not depend on the machine which has been chosen for processing the operation. This problem arises in the area of flexible manufacturing. As a generalization of the jobshop problem it belongs to the hardest problems in combinatorial optimization. We show that an application of… CONTINUE READING
Highly Influential
This paper has highly influenced 17 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
113 Citations
22 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 113 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

The shifting bottleneck procedure for job-shop scheduling

  • J Adams, E Balas, D Zawack
  • Manag Sci
  • 1988
Highly Influential
4 Excerpts

Bounds for certain multiprocessing anomalies

  • RL Graham
  • Bell Syst Tech J
  • 1966
Highly Influential
3 Excerpts

L6sung von Multi-Purpose Job-Shop Problemen durch Tabu-Suche, Diplomarbeit, Fachbereich Mathematik/ Informatik, Universit~it Osnabriick

  • M Thole
  • 1993

Similar Papers

Loading similar papers…