東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Simulation and Optimization of Scheduling Policies in Dynamic Stochastic Resource-Constrained Multi-Project Environments.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Simulation and Optimization of Scheduling Policies in Dynamic Stochastic Resource-Constrained Multi-Project Environments./
Author:	Satic, Ugur.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2022,
Description:	127 p.
Notes:	Source: Dissertations Abstracts International, Volume: 83-11, Section: B.
Contained By:	Dissertations Abstracts International83-11B.
Subject:	Scheduling. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29073433
ISBN:	9798426870031

Simulation and Optimization of Scheduling Policies in Dynamic Stochastic Resource-Constrained Multi-Project Environments.
Satic, Ugur.

Simulation and Optimization of Scheduling Policies in Dynamic Stochastic Resource-Constrained Multi-Project Environments. - Ann Arbor : ProQuest Dissertations & Theses, 2022 - 127 p.

Source: Dissertations Abstracts International, Volume: 83-11, Section: B.

Thesis (Ph.D.)--Lancaster University (United Kingdom), 2022.

This item must not be sold to any third party vendors.

The goal of the Project Management is to organise project schedules to complete projects before their completion dates, specified in their contract. When a project is beyond its completion date, organisations may lose the rewards from project completion as well as their organisational prestige. Project Management involves many uncertain factors such as unknown new project arrival dates and unreliable task duration predictions, which may affect project schedules that lead to delivery overruns. Successful Project Management could be done by considering these uncertainties. In this PhD study, we aim to create a more comprehensive model which considers a system where projects (of multiple types) arrive at random to the resource-constrained environment for which rewards for project delivery are impacted by fees for late project completion and tasks may complete sooner or later than expected task duration.In this thesis, we considered two extensions of the resource-constrained multi-project scheduling problem (RCMPSP) in dynamic environments. RCMPSP requires scheduling tasks of multiple projects simultaneously using a pool of limited renewable resources, and its goal usually is the shortest make-span or the highest profit. The first extension of RCMPSP is the dynamic resource-constrained multi-project scheduling problem. Dynamic in this problem refers that new projects arrive randomly during the ongoing project execution, which disturbs the existing project scheduling plan. The second extension of RCMPSP is the dynamic and stochastic resource-constrained multi-project scheduling problem. Dynamic and stochastic represent that both random new projects arrivals and stochastic task durations. In these problems, we assumed that projects generate rewards at their completion; completions later than a due date cause tardiness costs, and we seek to maximise average profits per unit time or the expected discounted long-run profit. We model these problems as infinite-horizon discrete-time Markov decision processes.

ISBN: 9798426870031Subjects--Topical Terms:

750729
Scheduling.

Simulation and Optimization of Scheduling Policies in Dynamic Stochastic Resource-Constrained Multi-Project Environments.
LDR:03173nmm a2200337 4500 001 2351576
005 20221107090129.5
008 241004s2022 ||||||||||||||||| ||eng d
020 $a 9798426870031
035 $a (MiAaPQ)AAI29073433
035 $a (MiAaPQ)Lancaster_164531
035 $a AAI29073433
040 $a MiAaPQ $c MiAaPQ
100 1 $a Satic, Ugur. $3 3691150
245 1 0 $a Simulation and Optimization of Scheduling Policies in Dynamic Stochastic Resource-Constrained Multi-Project Environments.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2022
300 $a 127 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-11, Section: B.
500 $a Advisor: Jacko, Peter;Kirkbride, Christopher.
502 $a Thesis (Ph.D.)--Lancaster University (United Kingdom), 2022.
506 $a This item must not be sold to any third party vendors.
520 $a The goal of the Project Management is to organise project schedules to complete projects before their completion dates, specified in their contract. When a project is beyond its completion date, organisations may lose the rewards from project completion as well as their organisational prestige. Project Management involves many uncertain factors such as unknown new project arrival dates and unreliable task duration predictions, which may affect project schedules that lead to delivery overruns. Successful Project Management could be done by considering these uncertainties. In this PhD study, we aim to create a more comprehensive model which considers a system where projects (of multiple types) arrive at random to the resource-constrained environment for which rewards for project delivery are impacted by fees for late project completion and tasks may complete sooner or later than expected task duration.In this thesis, we considered two extensions of the resource-constrained multi-project scheduling problem (RCMPSP) in dynamic environments. RCMPSP requires scheduling tasks of multiple projects simultaneously using a pool of limited renewable resources, and its goal usually is the shortest make-span or the highest profit. The first extension of RCMPSP is the dynamic resource-constrained multi-project scheduling problem. Dynamic in this problem refers that new projects arrive randomly during the ongoing project execution, which disturbs the existing project scheduling plan. The second extension of RCMPSP is the dynamic and stochastic resource-constrained multi-project scheduling problem. Dynamic and stochastic represent that both random new projects arrivals and stochastic task durations. In these problems, we assumed that projects generate rewards at their completion; completions later than a due date cause tardiness costs, and we seek to maximise average profits per unit time or the expected discounted long-run profit. We model these problems as infinite-horizon discrete-time Markov decision processes.
590 $a School code: 0416.
650 4 $a Scheduling. $3 750729
650 4 $a Monte Carlo simulation. $3 3564916
650 4 $a Software. $2 gtt. $3 619355
650 4 $a Dynamic programming. $3 641303
650 4 $a Genetic algorithms. $3 533907
650 4 $a Decision making. $3 517204
650 4 $a Operations research. $3 547123
650 4 $a Performance evaluation. $3 3562292
650 4 $a Markov analysis. $3 3562906
650 4 $a Artificial intelligence. $3 516317
650 4 $a Computer science. $3 523869
690 $a 0796
690 $a 0800
690 $a 0984
690 $a 0454
710 2 $a Lancaster University (United Kingdom). $3 1294170
773 0 $t Dissertations Abstracts International $g 83-11B.
790 $a 0416
791 $a Ph.D.
792 $a 2022
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29073433