View in EDS

Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed.

Saved in:
Bibliographic Details
Title: Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed.
Authors: Azizoglu, M., Koksalan, M., Koksalan, S.K.
Source: Journal of the Operational Research Society. Jun2003, Vol. 54 Issue 6, p661. 4p.
Subjects: Production scheduling, Algorithms, Polynomials
Abstract: We address the bi-criteria problem of minimizing the number of tardy jobs and maximum earliness on a single machine where machine idle time is allowed. We show that the problem of minimizing the number of tardy jobs while maximum earliness is kept at its minimum value of zero is polynomially solvable. We present polynomial time algorithms for the maximum earliness problem subject to no tardy jobs and the maximum earliness problem for a given set of tardy jobs. Finally, we discuss the use of the latter algorithm in generating all efficient schedules. [ABSTRACT FROM AUTHOR]
Copyright of Journal of the Operational Research Society 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.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 10146447
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Azizoglu%2C+M%2E%22">Azizoglu, M.</searchLink><br /><searchLink fieldCode="AR" term="%22Koksalan%2C+M%2E%22">Koksalan, M.</searchLink><br /><searchLink fieldCode="AR" term="%22Koksalan%2C+S%2EK%2E%22">Koksalan, S.K.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+the+Operational+Research+Society%22">Journal of the Operational Research Society</searchLink>. Jun2003, Vol. 54 Issue 6, p661. 4p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Polynomials%22">Polynomials</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We address the bi-criteria problem of minimizing the number of tardy jobs and maximum earliness on a single machine where machine idle time is allowed. We show that the problem of minimizing the number of tardy jobs while maximum earliness is kept at its minimum value of zero is polynomially solvable. We present polynomial time algorithms for the maximum earliness problem subject to no tardy jobs and the maximum earliness problem for a given set of tardy jobs. Finally, we discuss the use of the latter algorithm in generating all efficient schedules. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of the Operational Research Society 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=egs&AN=10146447
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1057/palgrave.jors.2601478
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 4
        StartPage: 661
    Subjects:
      – SubjectFull: Production scheduling
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Polynomials
        Type: general
    Titles:
      – TitleFull: Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Azizoglu, M.
      – PersonEntity:
          Name:
            NameFull: Koksalan, M.
      – PersonEntity:
          Name:
            NameFull: Koksalan, S.K.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2003
              Type: published
              Y: 2003
          Identifiers:
            – Type: issn-print
              Value: 01605682
          Numbering:
            – Type: volume
              Value: 54
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: Journal of the Operational Research Society
              Type: main
ResultId 1