Solving the job shop scheduling problem with tabu search.
Saved in:
| Title: | Solving the job shop scheduling problem with tabu search. |
|---|---|
| Authors: | Barnes, J. Wesley1, Chambers, John B.1 |
| Source: | IIE Transactions. Apr95, Vol. 27 Issue 2, p257-263. 7p. 1 Diagram, 5 Charts. |
| Subjects: | Production scheduling, Operations research, Heuristic, Machinery |
| Abstract: | In the job shop scheduling problem we desire to minimize the makespan where a set of machines perform technologically ordered operations unique to each member of a set of jobs. Each operation has a fixed time duration, no machine can perform more than one operation at a time, and preemption is not allowed. In this paper, an effective tabu search approach to the job shop scheduling problem is presented. The procedure starts from the best solution rendered by a set of 14 heuristic dispatching solutions. It then makes use of the classical disjunctive network representation of the problem and iteratively moves to another feasible solution by reversing the order of two adjacent critical path operations performed by the same machine. The concepts of historical generators and search restart are used in conjunction with a contiguous spectrum of short term memory values to enhance the overall exploration strategy. Computational results are presented and areas for future investigation are suggested. [ABSTRACT FROM AUTHOR] |
| Copyright of IIE Transactions is the property of Taylor & Francis Ltd 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!
