View in EDS

Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity.

Saved in:
Bibliographic Details
Title: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity.
Authors: Timkovsky, Vadim G.1,2 timko@cgi.ca
Source: European Journal of Operational Research. 9/1/2003, Vol. 149 Issue 2, p355-376. 22p.
Subjects: Connection machines, Parallel computers, Production scheduling, Operations research, Production control, Mathematical programming
Abstract: This paper surveys, analyses and establishes new polynomial-time reductions among scheduling problems that connect identical parallel machines with unit-time shops and the preemption facility with chain-like precedence constraints in same machine environments. The reductions turn out to be unexpectedly fruitful in clarifying the complexity status of many scheduling problems that were open before. The main purpose of this paper is revealing the relationship between problems in different scheduling classes. [Copyright &y& Elsevier]
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: 9792004
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Timkovsky%2C+Vadim+G%2E%22">Timkovsky, Vadim G.</searchLink><relatesTo>1,2</relatesTo><i> timko@cgi.ca</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22European+Journal+of+Operational+Research%22">European Journal of Operational Research</searchLink>. 9/1/2003, Vol. 149 Issue 2, p355-376. 22p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Connection+machines%22">Connection machines</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+computers%22">Parallel computers</searchLink><br /><searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Operations+research%22">Operations research</searchLink><br /><searchLink fieldCode="DE" term="%22Production+control%22">Production control</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+programming%22">Mathematical programming</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper surveys, analyses and establishes new polynomial-time reductions among scheduling problems that connect identical parallel machines with unit-time shops and the preemption facility with chain-like precedence constraints in same machine environments. The reductions turn out to be unexpectedly fruitful in clarifying the complexity status of many scheduling problems that were open before. The main purpose of this paper is revealing the relationship between problems in different scheduling classes. [Copyright &y& Elsevier]
– 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=9792004
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/S0377-2217(02)00767-1
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 22
        StartPage: 355
    Subjects:
      – SubjectFull: Connection machines
        Type: general
      – SubjectFull: Parallel computers
        Type: general
      – SubjectFull: Production scheduling
        Type: general
      – SubjectFull: Operations research
        Type: general
      – SubjectFull: Production control
        Type: general
      – SubjectFull: Mathematical programming
        Type: general
    Titles:
      – TitleFull: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Timkovsky, Vadim G.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: 9/1/2003
              Type: published
              Y: 2003
          Identifiers:
            – Type: issn-print
              Value: 03772217
          Numbering:
            – Type: volume
              Value: 149
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: European Journal of Operational Research
              Type: main
ResultId 1