Solving Project Scheduling Problem with Variable Activity Intensity by Linear Programming

碩士 === 國立清華大學 === 工業工程與工程管理學系 === 95 === In this study, we consider a resource constrained project scheduling problem with variable activity intensity. In this problem, the resource consumption of an activity is a variable and is proportional to the activity intensity. Based on the theory of Leontie...

Full description

Bibliographic Details
Main Author: 吳俊炘
Other Authors: 洪一峯
Format: Others
Language:zh-TW
Published: 2007
Online Access:http://ndltd.ncl.edu.tw/handle/49192854531251316812
id ndltd-TW-095NTHU5031077
record_format oai_dc
spelling ndltd-TW-095NTHU50310772015-10-13T16:51:14Z http://ndltd.ncl.edu.tw/handle/49192854531251316812 Solving Project Scheduling Problem with Variable Activity Intensity by Linear Programming 利用線性規劃求解可變作業強度之專案排程問題 吳俊炘 碩士 國立清華大學 工業工程與工程管理學系 95 In this study, we consider a resource constrained project scheduling problem with variable activity intensity. In this problem, the resource consumption of an activity is a variable and is proportional to the activity intensity. Based on the theory of Leontief production functions, Hackman and Leachman 【1989】 first introduce the concept of activity intensity. Leachman et al.【1990】 apply the theory of Leontief production functions to project scheduling problem and propose that the resource consumption is proportional to activity intensity, and the activity duration is the reciprocal of the activity intensity. Therefore, the activity intensity can be used to establish the relationship between resource consumption and activity duration in a resource constrained project scheduling problem. However, our literature survey reveals that only a few studies focused on this type of problem. These researchers used a nonlinear program or a mixed integer linear program to model the problem. If a heuristic approach is used, it cannot guarantee an optimal solution. Hence, we propose an approach that uses a linear program formulation. To use linear program, we have to take care of two problems. The first problem is that the actual relationship between intensity and duration is nonlinear convex function. In this study, we propose to use piece-wise linear curve to approximate the nonlinear convex curve. The second problem is that there are many feasible event sequences. An event sequence unique determines a set of resource constraints of its corresponding linear programming problem. Therefore, by solving all the linear programs of all the feasible event sequence, we can obtain the optimal solution of the resource constrained projected scheduling problem. Keywords: resource constrained project scheduling, variable intensity activities,linear programming, piece-wise linear curve 洪一峯 2007 學位論文 ; thesis 113 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立清華大學 === 工業工程與工程管理學系 === 95 === In this study, we consider a resource constrained project scheduling problem with variable activity intensity. In this problem, the resource consumption of an activity is a variable and is proportional to the activity intensity. Based on the theory of Leontief production functions, Hackman and Leachman 【1989】 first introduce the concept of activity intensity. Leachman et al.【1990】 apply the theory of Leontief production functions to project scheduling problem and propose that the resource consumption is proportional to activity intensity, and the activity duration is the reciprocal of the activity intensity. Therefore, the activity intensity can be used to establish the relationship between resource consumption and activity duration in a resource constrained project scheduling problem. However, our literature survey reveals that only a few studies focused on this type of problem. These researchers used a nonlinear program or a mixed integer linear program to model the problem. If a heuristic approach is used, it cannot guarantee an optimal solution. Hence, we propose an approach that uses a linear program formulation. To use linear program, we have to take care of two problems. The first problem is that the actual relationship between intensity and duration is nonlinear convex function. In this study, we propose to use piece-wise linear curve to approximate the nonlinear convex curve. The second problem is that there are many feasible event sequences. An event sequence unique determines a set of resource constraints of its corresponding linear programming problem. Therefore, by solving all the linear programs of all the feasible event sequence, we can obtain the optimal solution of the resource constrained projected scheduling problem. Keywords: resource constrained project scheduling, variable intensity activities,linear programming, piece-wise linear curve
author2 洪一峯
author_facet 洪一峯
吳俊炘
author 吳俊炘
spellingShingle 吳俊炘
Solving Project Scheduling Problem with Variable Activity Intensity by Linear Programming
author_sort 吳俊炘
title Solving Project Scheduling Problem with Variable Activity Intensity by Linear Programming
title_short Solving Project Scheduling Problem with Variable Activity Intensity by Linear Programming
title_full Solving Project Scheduling Problem with Variable Activity Intensity by Linear Programming
title_fullStr Solving Project Scheduling Problem with Variable Activity Intensity by Linear Programming
title_full_unstemmed Solving Project Scheduling Problem with Variable Activity Intensity by Linear Programming
title_sort solving project scheduling problem with variable activity intensity by linear programming
publishDate 2007
url http://ndltd.ncl.edu.tw/handle/49192854531251316812
work_keys_str_mv AT wújùnxīn solvingprojectschedulingproblemwithvariableactivityintensitybylinearprogramming
AT wújùnxīn lìyòngxiànxìngguīhuàqiújiěkěbiànzuòyèqiángdùzhīzhuānànpáichéngwèntí
_version_ 1717775226882752512