View in EDS PDF Full Text

An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.

Saved in:
Bibliographic Details
Title: An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.
Authors: Zhang, Wenda1, wzhang95@illinois.edu, Sauppe, Jason J.2, jsauppe@uwlax.edu, Jacobson, Sheldon H.3, shj@illinois.edu
Source: INFORMS Journal on Computing; Summer2021, Vol. 33 Issue 3, p1091-1102, 12p
Database: Applied Science & Technology Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 152160086
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22Zhang%2C+Wenda%22">Zhang, Wenda</searchLink><relatesTo>1</relatesTo>, <i>wzhang95@illinois.edu</i><br /><searchLink fieldCode="AU" term="%22Sauppe%2C+Jason+J%2E%22">Sauppe, Jason J.</searchLink><relatesTo>2</relatesTo>, <i>jsauppe@uwlax.edu</i><br /><searchLink fieldCode="AU" term="%22Jacobson%2C+Sheldon+H%2E%22">Jacobson, Sheldon H.</searchLink><relatesTo>3</relatesTo>, <i>shj@illinois.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22INFORMS+Journal+on+Computing%22">INFORMS Journal on Computing</searchLink>; Summer2021, Vol. 33 Issue 3, p1091-1102, 12p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=152160086
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1287/ijoc.2020.0988
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 1091
    Titles:
      – TitleFull: An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zhang, Wenda
      – PersonEntity:
          Name:
            NameFull: Sauppe, Jason J.
      – PersonEntity:
          Name:
            NameFull: Jacobson, Sheldon H.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Summer2021
              Type: published
              Y: 2021
          Identifiers:
            – Type: issn-print
              Value: 10919856
          Numbering:
            – Type: volume
              Value: 33
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: INFORMS Journal on Computing
              Type: main
ResultId 1