現在位置首頁 > 博碩士論文 > 詳目
  • 同意授權
論文中文名稱:OPTIMIZATION OF TEAM ALLOCATION FOR MULTIPLE PROJECTS [以論文名稱查詢館藏系統]
論文英文名稱:OPTIMIZATION OF TEAM ALLOCATION FOR MULTIPLE PROJECTS [以論文名稱查詢館藏系統]
院校名稱:臺北科技大學
學院名稱:管理學院
系所名稱:管理國際學生碩士專班 (IMBA)
畢業學年度:103
畢業學期:第二學期
中文姓名:Kanoknat Satchawitwisarn
英文姓名:Kanoknat Satchawitwisarn
研究生學號:102988015
學位類別:碩士
口試日期:2015/06/15
指導教授中文名:吳建文
指導教授英文名:Wú jiànwén
口試委員中文名:吳建文;李炯三;陳育威
口試委員英文名:Wú jiànwén;Lǐjiǒngsān;Chényùwēi
中文關鍵詞:Team Formation, Project Scheduling, Greedy algorithm
英文關鍵詞:Team Formation, Project Scheduling, Greedy algorithm
論文中文摘要:Allocating employees to form teams able to complete projects in the most efficient way is a key problem in many fields. Selecting employees to form the best team and simultaneously choosing which project to realize is a hard decision encountered by many enterprises.
This research considers the problem of team allocation in reality multiple projects. The employees’ and projects’ profiles, including factors such as the availability of the employees, duration of the projects, the budget of each project, and the employees’ monthly salaries. The objective is to maximize the company’s profit by selecting the most suitable time slots to form a team which can handle the project with the highest monthly profit.
A mathematical model is provided for the problem. The proposed schedule will contain all the time slots that can be used to create teams. Those time slots have to meet the project and profit constraints which can be calculate the estimated number of months to finish the project, and employees’ salary. With this model, it will be possible to select an optimal team distribution. To solve this model, a greedy algorithm will be used. Experiments will then be performed to show the effectiveness and the performance of the model. This paper, “Optimization of Team Allocation for Multiple Projects”, by considering the employees’ unavailability and using greedy algorithm, to relevant in the practice of project allocation.
論文英文摘要:Allocating employees to form teams able to complete projects in the most efficient way is a key problem in many fields. Selecting employees to form the best team and simultaneously choosing which project to realize is a hard decision encountered by many enterprises.
This research considers the problem of team allocation in reality multiple projects. The employees’ and projects’ profiles, including factors such as the availability of the employees, duration of the projects, the budget of each project, and the employees’ monthly salaries. The objective is to maximize the company’s profit by selecting the most suitable time slots to form a team which can handle the project with the highest monthly profit.
A mathematical model is provided for the problem. The proposed schedule will contain all the time slots that can be used to create teams. Those time slots have to meet the project and profit constraints which can be calculate the estimated number of months to finish the project, and employees’ salary. With this model, it will be possible to select an optimal team distribution. To solve this model, a greedy algorithm will be used. Experiments will then be performed to show the effectiveness and the performance of the model. This paper, “Optimization of Team Allocation for Multiple Projects”, by considering the employees’ unavailability and using greedy algorithm, to relevant in the practice of project allocation.
論文目次:Abstract i
Acknowledgements ii
Table of Contents iii
List of Tables iv
List of Figures v
Chapter I: Introduction - 1 -
1.1 Study Purpose - 1 -
1.2 Research Procedure - 2 -
1.3 Study Structure - 3 -
Chapter II: Literature Review - 4 -
2.1 Project scheduling - 4 -
2.2 Team Formation - 12 -
Chapter III: Mathematical Model - 15 -
3.1 Problem Model - 15 -
3.2 Example - 18 -
Chapter IV: Algorithm Solution - 26 -
4.1 Greedy Algorithm - 26 -
Chapter V: Example Illustration - 28 -
5.1 Example - 28 -
Chapter VI: Conclusion and Suggestions - 31 -
6.1 Conclusion - 31 -
6.2 Suggestions - 31 -
References - 33 -
論文參考文獻:1. A.F. Carazo, Trinidad Gomez, Julian Molina, Alfredo G. Hernandez-Diaz, Flor M. Guerrero, Rafael Caballero. (2009). Solving a comprehensive model for multiobjective project portfolio selection. Computers & Operations Research 37.
2. Akhil Kumar, R.M. Dijkman, Minseok Song. (2013). Optimal work assignment in team processes for maximizing cooperation. En Business Process Management (págs. 235-250). Springer.
3. Alfares, H. K. (2003). Flexible 4-day workweek scheduling with weekend work frequency constraints. Computers & industrial engineering 2003, vol. 44.
4. Anagnostopoulos A., Becchetti L., Castillo C., Gionis A., Leonardi S. (2012). Online Team Formation in Social Networks. WWW’12 Proceedings of the 21st international conference on World Wide Web.
5. Artigues C., Gendreau M., Rousseau L., Vergnaud A. (2008). Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound. Elsevier Computers & Operations Research 36.
6. Drezet LE., Billaut JC. (2006). A project scheduling problem with labour constraints and time-dependent activities requirements. International journal of production economics.
7. Escudero L., Salmeron J. (2005). On a fix-and-relax Framework for a class of project scheduling problems. Annals of Operations Research 140.
8. Gajewar A., Das Sarma A. (2011). Multi Skill Collaborative Teams based on Denset Subgraphs. Journal Computing Research Repository volume abs/ 1102.3340.
9. Ghorbani S., Rabbani M. (2007). A new multi-objective algorithm for a project selection problem. Advances in Engineering Software 40.
10. Hartmann S., Briskorn D. (2009). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operation Research 207.
11. Hubault, A. S. (2013). Team Formation for Multiple Projects.
12. Korvin A. Shipley M., Kleyle R. (2002). Utilizing fuzzy compatibility skill sets for team selection in multi-phase projects. Journal of engineering and technology management Jet-M 19.
13. Lappas T. Liu K., Terzi E. (2009). Finding a Team of Experts in Social Networks. KDD '09 Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining.
14. Mohan, S. (2008). Scheduling part-time personnel with availability restrictions and preferences to maximize employee satisfaction. Mathematical and Computer Modelling Volume 48.
15. Pisinger, D. (1995). Algorithms for Knapsack Problems. Copenhagen, Denmark.
16. Rabbani M., Aramoon Bajestani M., Baharian Khoshkhou G. (2010). A multi-objective particle swarm optimization for project selection problem. Expert Systems with Applications 37.
17. Wi H., Oh S., Mun J., Jung M. (2009). A team formation based on knowledge and collaboration. Expert Systems with Applications: An International Journal volume 36.
論文全文使用權限:同意授權於2015-07-07起公開