Academic Journal
Προβολή σε EDS

Scheduling jobs with release dates and deadlines on a batch processing machine.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Scheduling jobs with release dates and deadlines on a batch processing machine.
Συγγραφείς: T.C. Edwin Cheng1 mscheng@polyu.edu.hk, Zhaohui Liu1,2, Wenci Yu2
Πηγή: IIE Transactions. Aug2001, Vol. 33 Issue 8, p685. 6p. 1 Chart.
Θεματικοί όροι: *Deadlines, *Production scheduling, *Management science, *Continuous processing, *Batch processing, *Electronic data processing, *Algorithms, *Manufacturing processes, Batch processing in electronic data processing
Περίληψη: In this paper, we investigate the unbounded version of scheduling jobs with release dates and deadlines on a batch processing machine. NP-completeness is established for the case where all jobs have agreeable processing times and deadlines. Polynomial time algorithms are presented for the following cases: agreeable release dates and deadlines: agreeable release dates and processing times: a fixed number of distinct release dates, distinct processing times or distinct deadlines. [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.)
Βάση Δεδομένων: Business Source Index
FullText Links:
  – Type: other
Text:
  Availability: 0
CustomLinks:
  – Url: https://dx.doi.org/doi:10.1023/A%3A1010991401683
    Name: EDS - Springer Nature Journals (s7799221)
    Category: fullText
    Text: View record at Springer
Header DbId: bsx
DbLabel: Business Source Index
An: 4898497
RelevancyScore: 1171
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1171.3779296875
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Scheduling jobs with release dates and deadlines on a batch processing machine.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22T%2EC%2E+Edwin+Cheng%22">T.C. Edwin Cheng</searchLink><relatesTo>1</relatesTo><i> mscheng@polyu.edu.hk</i><br /><searchLink fieldCode="AR" term="%22Zhaohui+Liu%22">Zhaohui Liu</searchLink><relatesTo>1,2</relatesTo><br /><searchLink fieldCode="AR" term="%22Wenci+Yu%22">Wenci Yu</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IIE+Transactions%22">IIE Transactions</searchLink>. Aug2001, Vol. 33 Issue 8, p685. 6p. 1 Chart.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Deadlines%22">Deadlines</searchLink><br />*<searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br />*<searchLink fieldCode="DE" term="%22Management+science%22">Management science</searchLink><br />*<searchLink fieldCode="DE" term="%22Continuous+processing%22">Continuous processing</searchLink><br />*<searchLink fieldCode="DE" term="%22Batch+processing%22">Batch processing</searchLink><br />*<searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br />*<searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br />*<searchLink fieldCode="DE" term="%22Manufacturing+processes%22">Manufacturing processes</searchLink><br /><searchLink fieldCode="DE" term="%22Batch+processing+in+electronic+data+processing%22">Batch processing in electronic data processing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: In this paper, we investigate the unbounded version of scheduling jobs with release dates and deadlines on a batch processing machine. NP-completeness is established for the case where all jobs have agreeable processing times and deadlines. Polynomial time algorithms are presented for the following cases: agreeable release dates and deadlines: agreeable release dates and processing times: a fixed number of distinct release dates, distinct processing times or distinct deadlines. [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=bsx&AN=4898497
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1023/A:1010991401683
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 6
        StartPage: 685
    Subjects:
      – SubjectFull: Deadlines
        Type: general
      – SubjectFull: Production scheduling
        Type: general
      – SubjectFull: Management science
        Type: general
      – SubjectFull: Continuous processing
        Type: general
      – SubjectFull: Batch processing
        Type: general
      – SubjectFull: Electronic data processing
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Manufacturing processes
        Type: general
      – SubjectFull: Batch processing in electronic data processing
        Type: general
    Titles:
      – TitleFull: Scheduling jobs with release dates and deadlines on a batch processing machine.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: T.C. Edwin Cheng
      – PersonEntity:
          Name:
            NameFull: Zhaohui Liu
      – PersonEntity:
          Name:
            NameFull: Wenci Yu
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2001
              Type: published
              Y: 2001
          Identifiers:
            – Type: issn-print
              Value: 0740817X
          Numbering:
            – Type: volume
              Value: 33
            – Type: issue
              Value: 8
          Titles:
            – TitleFull: IIE Transactions
              Type: main
ResultId 1