Multimode Preemptive Resource Investment Problem Subject to Due Dates for Activities: Formulation and Solution Procedure

The preemptive Multimode resource investment problem is investigated. The Objective is to minimize the total renewable/nonrenewable resource costs and earliness-tardiness costs by a given project deadline and due dates for activities. In this problem setting preemption is allowed with no setup cost...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Advances in Operations Research Ročník 2014; číslo 2014; s. 143 - 152
Hlavní autoři: Afshar-Nadjafi, Behrouz, Arani, Mohammad
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cairo, Egypt Hindawi Limiteds 01.01.2014
Hindawi Publishing Corporation
Hindawi Limited
John Wiley & Sons, Inc
Témata:
Costs
Due dates
Financing
Fines & penalties
Formulations
Genetic algorithms
Heuristic
Integer programming
Investment
Investments
Mathematical models
Nonrenewable resources
Operations research
Optimization
Preempting
Production scheduling
Project management
Renewable resources
Scheduling
United States
ISSN:1687-9147, 1687-9155
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The preemptive Multimode resource investment problem is investigated. The Objective is to minimize the total renewable/nonrenewable resource costs and earliness-tardiness costs by a given project deadline and due dates for activities. In this problem setting preemption is allowed with no setup cost or time. The project contains activities interrelated by finish-start type precedence relations with a time lag of zero, which require a set of renewable and nonrenewable resources. The problem formed in this way is an NP-hard. A mixed integer programming formulation is proposed for the problem and parameters tuned genetic algorithm (GA) is proposed to solve it. To evaluate the performance of the proposed algorithm, 120 test problems are used. Comparative statistical results reveal that the proposed GA is efficient and effective in terms of the objective function and computational times.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1687-9147
1687-9155
DOI:10.1155/2014/740670