A tabu search experience in production scheduling.
Saved in:
| Title: | A tabu search experience in production scheduling. |
|---|---|
| Authors: | Barnes, J. Wesley1, Laguna, Manuel2 |
| Source: | Annals of Operations Research. 1993, Vol. 41 Issue 1-4, p141-156. 16p. 1 Diagram, 1 Chart. |
| Subjects: | Combinatorial optimization, Production scheduling, Combinatorics, Mathematical optimization, Research |
| Abstract: | During the last four years, tabu search has been shown to be a remarkably effective method in solving difficult combinatorial optimization problems. Nowhere has this success been more marked than in the timely and very important area of production scheduling. In this paper, we review some of the research that has contributed to that success. We also give a synthesis of the various tabu search mechanisms that have been employed, giving special attention to advances that have led lo major improvements. In the final section of the paper, we suggest directions for future research. [ABSTRACT FROM AUTHOR] |
| Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
