View in EDS

Scheduling reentrant jobs on parallel machines with a remote server

Saved in:
Bibliographic Details
Title: Scheduling reentrant jobs on parallel machines with a remote server
Authors: Chakhlevitch, K. Konstantin.Chakhlevitch.1@city.ac.uk, Glass, C.A.1
Source: Computers & Operations Research. Sep2009, Vol. 36 Issue 9, p2580-2589. 10p.
Subjects: Heuristic programming, Web server software, Benchmarking (Management), Operations research, Microbiology, Problem solving, Remote access networks, Computer software, Computer network resources
Abstract: Abstract: This paper explores a specific combinatorial problem relating to reentrant jobs on parallel primary machines, with a remote server machine. A middle operation is required by each job on the server before it returns to its primary processing machine. The problem, which is new to the literature, is inspired by the logistics of a semi-automated microbiology laboratory. We establish the NP-hard nature of the problem, and demonstrate various structural properties. A heuristic is developed and tested on randomly generated benchmark data. No alternative heuristics are available in the literature for comparison, but results indicate solutions reliably within 1.5% of optimum. Moreover, tests of our heuristic on real-life data from the microbiology laboratory provide a 20% improvement in throughput relative to current practice. [Copyright &y& Elsevier]
Copyright of Computers & Operations Research is the property of Pergamon Press - An Imprint of Elsevier Science 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: 36781301
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Scheduling reentrant jobs on parallel machines with a remote server
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Chakhlevitch%2C+K%2E%22">Chakhlevitch, K.</searchLink><i> Konstantin.Chakhlevitch.1@city.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Glass%2C+C%2EA%2E%22">Glass, C.A.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computers+%26+Operations+Research%22">Computers & Operations Research</searchLink>. Sep2009, Vol. 36 Issue 9, p2580-2589. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Heuristic+programming%22">Heuristic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Web+server+software%22">Web server software</searchLink><br /><searchLink fieldCode="DE" term="%22Benchmarking+%28Management%29%22">Benchmarking (Management)</searchLink><br /><searchLink fieldCode="DE" term="%22Operations+research%22">Operations research</searchLink><br /><searchLink fieldCode="DE" term="%22Microbiology%22">Microbiology</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+solving%22">Problem solving</searchLink><br /><searchLink fieldCode="DE" term="%22Remote+access+networks%22">Remote access networks</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software%22">Computer software</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+network+resources%22">Computer network resources</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: This paper explores a specific combinatorial problem relating to reentrant jobs on parallel primary machines, with a remote server machine. A middle operation is required by each job on the server before it returns to its primary processing machine. The problem, which is new to the literature, is inspired by the logistics of a semi-automated microbiology laboratory. We establish the NP-hard nature of the problem, and demonstrate various structural properties. A heuristic is developed and tested on randomly generated benchmark data. No alternative heuristics are available in the literature for comparison, but results indicate solutions reliably within 1.5% of optimum. Moreover, tests of our heuristic on real-life data from the microbiology laboratory provide a 20% improvement in throughput relative to current practice. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computers & Operations Research is the property of Pergamon Press - An Imprint of Elsevier Science 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=36781301
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.cor.2008.11.007
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 2580
    Subjects:
      – SubjectFull: Heuristic programming
        Type: general
      – SubjectFull: Web server software
        Type: general
      – SubjectFull: Benchmarking (Management)
        Type: general
      – SubjectFull: Operations research
        Type: general
      – SubjectFull: Microbiology
        Type: general
      – SubjectFull: Problem solving
        Type: general
      – SubjectFull: Remote access networks
        Type: general
      – SubjectFull: Computer software
        Type: general
      – SubjectFull: Computer network resources
        Type: general
    Titles:
      – TitleFull: Scheduling reentrant jobs on parallel machines with a remote server
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Chakhlevitch, K.
      – PersonEntity:
          Name:
            NameFull: Glass, C.A.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2009
              Type: published
              Y: 2009
          Identifiers:
            – Type: issn-print
              Value: 03050548
          Numbering:
            – Type: volume
              Value: 36
            – Type: issue
              Value: 9
          Titles:
            – TitleFull: Computers & Operations Research
              Type: main
ResultId 1