View in EDS HTML Full Text PDF Full Text

Spread time considerations in operational fixed job scheduling.

Saved in:
Bibliographic Details
Title: Spread time considerations in operational fixed job scheduling.
Authors: Eliiyi, D. T.1 (AUTHOR), Azizoglu, M.2 (AUTHOR) meral@ie.metu.edu.tr
Source: International Journal of Production Research. 10/15/2006, Vol. 44 Issue 20, p4343-4365. 23p.
Subjects: Production scheduling, Production control, Size reduction of materials, Spread (Finance), Deadlines, Working hours, Algorithms, Employees, Extensions
Abstract: In this study, we consider the operational fixed job scheduling problem on identical parallel machines. We assume that the jobs have fixed ready times and deadlines, and spread time constraints are imposed on machines. Our objective is to select a set of jobs for processing so as to maximise the total weight. We show that the problem is strongly NP-hard, and we investigate several special polynomially solvable cases. We propose a branch and bound algorithm that employs size reduction mechanisms, dominance conditions, and powerful lower and upper bounds. The computational results reveal that the branch and bound algorithm returns optimal solutions for problem instances with up to 100 jobs in reasonable solution times. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research 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
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 22225969
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Spread time considerations in operational fixed job scheduling.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Eliiyi%2C+D%2E+T%2E%22">Eliiyi, D. T.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Azizoglu%2C+M%2E%22">Azizoglu, M.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> meral@ie.metu.edu.tr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. 10/15/2006, Vol. 44 Issue 20, p4343-4365. 23p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Production+control%22">Production control</searchLink><br /><searchLink fieldCode="DE" term="%22Size+reduction+of+materials%22">Size reduction of materials</searchLink><br /><searchLink fieldCode="DE" term="%22Spread+%28Finance%29%22">Spread (Finance)</searchLink><br /><searchLink fieldCode="DE" term="%22Deadlines%22">Deadlines</searchLink><br /><searchLink fieldCode="DE" term="%22Working+hours%22">Working hours</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Employees%22">Employees</searchLink><br /><searchLink fieldCode="DE" term="%22Extensions%22">Extensions</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: In this study, we consider the operational fixed job scheduling problem on identical parallel machines. We assume that the jobs have fixed ready times and deadlines, and spread time constraints are imposed on machines. Our objective is to select a set of jobs for processing so as to maximise the total weight. We show that the problem is strongly NP-hard, and we investigate several special polynomially solvable cases. We propose a branch and bound algorithm that employs size reduction mechanisms, dominance conditions, and powerful lower and upper bounds. The computational results reveal that the branch and bound algorithm returns optimal solutions for problem instances with up to 100 jobs in reasonable solution times. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Production Research 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=22225969
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/00207540500478645
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 23
        StartPage: 4343
    Subjects:
      – SubjectFull: Production scheduling
        Type: general
      – SubjectFull: Production control
        Type: general
      – SubjectFull: Size reduction of materials
        Type: general
      – SubjectFull: Spread (Finance)
        Type: general
      – SubjectFull: Deadlines
        Type: general
      – SubjectFull: Working hours
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Employees
        Type: general
      – SubjectFull: Extensions
        Type: general
    Titles:
      – TitleFull: Spread time considerations in operational fixed job scheduling.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Eliiyi, D. T.
      – PersonEntity:
          Name:
            NameFull: Azizoglu, M.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 10
              Text: 10/15/2006
              Type: published
              Y: 2006
          Identifiers:
            – Type: issn-print
              Value: 00207543
          Numbering:
            – Type: volume
              Value: 44
            – Type: issue
              Value: 20
          Titles:
            – TitleFull: International Journal of Production Research
              Type: main
ResultId 1