View in EDS

SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 15003210
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Barnes%2C+J%2E+Wesley%22">Barnes, J. Wesley</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Laguna%2C+Manuel%22">Laguna, Manuel</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IIE+Transactions%22">IIE Transactions</searchLink>. Mar93, Vol. 25 Issue 2, p121-128. 8p. 4 Diagrams, 2 Charts.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Multimachine+assignments%22">Multimachine assignments</searchLink><br /><searchLink fieldCode="DE" term="%22Methods+engineering%22">Methods engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Industrial+engineering%22">Industrial engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Methodology%22">Methodology</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=15003210
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/07408179308964284
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 8
        StartPage: 121
    Subjects:
      – SubjectFull: Multimachine assignments
        Type: general
      – SubjectFull: Methods engineering
        Type: general
      – SubjectFull: Industrial engineering
        Type: general
      – SubjectFull: Methodology
        Type: general
    Titles:
      – TitleFull: SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Barnes, J. Wesley
      – PersonEntity:
          Name:
            NameFull: Laguna, Manuel
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar93
              Type: published
              Y: 1993
          Identifiers:
            – Type: issn-print
              Value: 0740817X
          Numbering:
            – Type: volume
              Value: 25
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: IIE Transactions
              Type: main
ResultId 1