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
|
Project Status |
Completed (Fiscal Year 2017)
|
Budget Amount *help |
¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
Keywords | OR / アルゴリズム / 数理計画法 / スケジューリング / 離散凸解析 / 離散凸関数 / 整凸関数 / 数理工学 / 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.
|
Report
(5 results)
Research Products
(20 results)
-
-
-
-
-
-
[Journal Article] Scaling and proximity properties of integrally convex functions2016
Author(s)
S. Moriguchi, K. Murota, A. Tamura, and F. Tardella
-
Journal Title
Proceedings of the 27th International Symposium on Algorithms and Computation, Seok-Hee Hong (Ed.): ISAAC2016, Leibniz International Proceedings in Informatics (LIPIcs)
Volume: 64-57
DOI
Related Report
Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
-
-
-
-
-
-
-
-
-
-
-
-
-
-