View in EDS

A MULTIPLE OBJECTIVE PROGRAMMING FRAMEWORK FOR TRADEOFFS IN PROJECT SCHEDULING.

Saved in:
Bibliographic Details
Title: A MULTIPLE OBJECTIVE PROGRAMMING FRAMEWORK FOR TRADEOFFS IN PROJECT SCHEDULING.
Authors: Deckro, Richard F.1, Hebert, John E.2
Source: Engineering Costs & Production Economics. 1990, Vol. 18 Issue 3, p255-264. 10p.
Subjects: Linear programming, Production scheduling, Project management, Algorithms, Production management (Manufacturing), Vector analysis
Abstract: This paper presents a multiple objective linear programming (MOLP) model for project scheduling. The MOLP approach allows potentially conflicting objectives to be considered without the necessity of creating specific rankings or weights for the objectives, although such factors can be considered if they are desired. An efficient set of solutions is developed from which a final schedule may be selected by the project manager utilizing non-quantifiable criterion and factors. The approach can be implemented using computer algorithms readily available in the public domain. [ABSTRACT FROM AUTHOR]
Copyright of Engineering Costs & Production Economics 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: 14907677
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A MULTIPLE OBJECTIVE PROGRAMMING FRAMEWORK FOR TRADEOFFS IN PROJECT SCHEDULING.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Deckro%2C+Richard+F%2E%22">Deckro, Richard F.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Hebert%2C+John+E%2E%22">Hebert, John E.</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Engineering+Costs+%26+Production+Economics%22">Engineering Costs & Production Economics</searchLink>. 1990, Vol. 18 Issue 3, p255-264. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Linear+programming%22">Linear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Project+management%22">Project management</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Production+management+%28Manufacturing%29%22">Production management (Manufacturing)</searchLink><br /><searchLink fieldCode="DE" term="%22Vector+analysis%22">Vector analysis</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper presents a multiple objective linear programming (MOLP) model for project scheduling. The MOLP approach allows potentially conflicting objectives to be considered without the necessity of creating specific rankings or weights for the objectives, although such factors can be considered if they are desired. An efficient set of solutions is developed from which a final schedule may be selected by the project manager utilizing non-quantifiable criterion and factors. The approach can be implemented using computer algorithms readily available in the public domain. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Engineering Costs & Production Economics 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=14907677
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/0167-188X(90)90128-5
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 255
    Subjects:
      – SubjectFull: Linear programming
        Type: general
      – SubjectFull: Production scheduling
        Type: general
      – SubjectFull: Project management
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Production management (Manufacturing)
        Type: general
      – SubjectFull: Vector analysis
        Type: general
    Titles:
      – TitleFull: A MULTIPLE OBJECTIVE PROGRAMMING FRAMEWORK FOR TRADEOFFS IN PROJECT SCHEDULING.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Deckro, Richard F.
      – PersonEntity:
          Name:
            NameFull: Hebert, John E.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: 1990
              Type: published
              Y: 1990
          Identifiers:
            – Type: issn-print
              Value: 0167188X
          Numbering:
            – Type: volume
              Value: 18
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Engineering Costs & Production Economics
              Type: main
ResultId 1