2017 Fiscal Year Final Research Report
Scheduling under uncertainty and information-rich environment based on discrete convexity
| Project/Area Number |
26350430
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Tokyo Metropolitan University |
|---|
Principal Investigator |
|
|---|
| Research Collaborator |
KOBAYASHI Takaaki
|
|---|
| Project Period (FY) |
2014-04-01 – 2018-03-31
|
| Keywords | OR / アルゴリズム / 数理計画法 / スケジューリング / 離散凸解析 |
|---|
| Outline of Final Research Achievements |
We investigated the problems of discrete optimization which occur in each application field and theoretically analyzed the class of integrally convex functions which constitute a common framework for discrete convex functions, including separable convex, L-natural-convex and M-natural-convex functions.The new findings of this research are scalability and a proximity theorem of integral convexity. As a consequence of our proximity and scaling results, we derive a minimization algorithm.
Also, we developed a software for IT project scheduling to reduce the workload on the project manager by improving the efficiency of scheduling work in IT project management.
|
| Free Research Field |
離散凸解析
|
