View in EDS

Evaluation of scheduling algorithms for resources with high set-up time.

Saved in:
Bibliographic Details
Title: Evaluation of scheduling algorithms for resources with high set-up time.
Authors: Bovet, D.P., Petrini, M.
Source: European Journal of Operational Research. Sep80, Vol. 5 Issue 3, p182-192. 11p. 1 Diagram, 3 Charts, 7 Graphs.
Subjects: Production scheduling, Heuristic programming, Simulation methods & models
Abstract: Tapes and removable disks are considered resources with high set-up time. When dealing with such resources, a simple and apparently appealing heuristics consists of scheduling jobs to minimize the total nurnber of set-up. In this paper, we examine the validity of, such approach, developing both a probabilistic and a simulation model. For sake of concreteness, the example considered refers to a system consisting of a tape library and a limited number of drives. The results obtained are discussed and the problem of applying the proposed evaluation technique to computer centers with different library frequency distributions is examined. [ABSTRACT FROM AUTHOR]
Copyright of European Journal of Operational Research is the property of Elsevier B.V. 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: 8512890
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Evaluation of scheduling algorithms for resources with high set-up time.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Bovet%2C+D%2EP%2E%22">Bovet, D.P.</searchLink><br /><searchLink fieldCode="AR" term="%22Petrini%2C+M%2E%22">Petrini, M.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22European+Journal+of+Operational+Research%22">European Journal of Operational Research</searchLink>. Sep80, Vol. 5 Issue 3, p182-192. 11p. 1 Diagram, 3 Charts, 7 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic+programming%22">Heuristic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Simulation+methods+%26+models%22">Simulation methods & models</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Tapes and removable disks are considered resources with high set-up time. When dealing with such resources, a simple and apparently appealing heuristics consists of scheduling jobs to minimize the total nurnber of set-up. In this paper, we examine the validity of, such approach, developing both a probabilistic and a simulation model. For sake of concreteness, the example considered refers to a system consisting of a tape library and a limited number of drives. The results obtained are discussed and the problem of applying the proposed evaluation technique to computer centers with different library frequency distributions is examined. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of European Journal of Operational Research is the property of Elsevier B.V. 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=8512890
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/0377-2217(80)90088-0
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 182
    Subjects:
      – SubjectFull: Production scheduling
        Type: general
      – SubjectFull: Heuristic programming
        Type: general
      – SubjectFull: Simulation methods & models
        Type: general
    Titles:
      – TitleFull: Evaluation of scheduling algorithms for resources with high set-up time.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Bovet, D.P.
      – PersonEntity:
          Name:
            NameFull: Petrini, M.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep80
              Type: published
              Y: 1980
          Identifiers:
            – Type: issn-print
              Value: 03772217
          Numbering:
            – Type: volume
              Value: 5
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: European Journal of Operational Research
              Type: main
ResultId 1