View in EDS PDF Full Text

A tabu search experience in production scheduling.

Saved in:
Bibliographic Details
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 18938839
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A tabu search experience in production scheduling.
– 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="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>. 1993, Vol. 41 Issue 1-4, p141-156. 16p. 1 Diagram, 1 Chart.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Combinatorial+optimization%22">Combinatorial optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorics%22">Combinatorics</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Research%22">Research</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=18938839
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 16
        StartPage: 141
    Subjects:
      – SubjectFull: Combinatorial optimization
        Type: general
      – SubjectFull: Production scheduling
        Type: general
      – SubjectFull: Combinatorics
        Type: general
      – SubjectFull: Mathematical optimization
        Type: general
      – SubjectFull: Research
        Type: general
    Titles:
      – TitleFull: A tabu search experience in production scheduling.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Barnes, J. Wesley
      – PersonEntity:
          Name:
            NameFull: Laguna, Manuel
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: 1993
              Type: published
              Y: 1993
          Identifiers:
            – Type: issn-print
              Value: 02545330
          Numbering:
            – Type: volume
              Value: 41
            – Type: issue
              Value: 1-4
          Titles:
            – TitleFull: Annals of Operations Research
              Type: main
ResultId 1