Bibliographic Details
| Title: |
SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH. |
| Authors: |
Barnes, J. Wesley1, Laguna, Manuel2 |
| Source: |
IIE Transactions. Mar93, Vol. 25 Issue 2, p121-128. 8p. 4 Diagrams, 2 Charts. |
| Subjects: |
Multimachine assignments, Methods engineering, Industrial engineering, Methodology |
| Abstract: |
In this paper we discuss the development and application of a new and more powerful method for solving the multiple-machine weighted flow time problem using a basic tabu search (TS) approach. Previous methods of solution used branch and bound and are computationally limited to problems of about 25 jobs. In a set of previously published problems with 15 to 30 jobs, the new method achieved optimality in at least an order of magnitude less computation time than branch and bound first achieved the optimum. Studies of larger problems indicate that the new method maintains its ability to achieve superior solutions with only a modest growth in computational effort. [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 |
