Designing job rotation schedules using matching theory
Project/Area Number |
26885028
|
Research Category |
Grant-in-Aid for Research Activity Start-up
|
Allocation Type | Single-year Grants |
Research Field |
Economic theory
|
Research Institution | Tokyo Institute of Technology |
Principal Investigator |
Bando Keisuke 東京工業大学, 社会理工学研究科, 助教 (50735412)
|
Project Period (FY) |
2014-08-29 – 2016-03-31
|
Project Status |
Completed (Fiscal Year 2015)
|
Budget Amount *help |
¥2,730,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥630,000)
Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
Keywords | マッチング / ジョブローテーション / スケジューリング / ゲーム理論 / マッチング理論 |
Outline of Final Research Achievements |
The purpose of this study is to design job rotation schedules that reflect preferences of workers. To do so, we developed a theoretical model called dynamic matching model with constraints. We propose an algorithm to find efficient and stable job ratation schedules under some assumptions on the preferences of workers.
|
Report
(3 results)
Research Products
(5 results)