期刊文献+

基于ILOG CPLEX的任务规划过程的设计与实现

Design and Realization of Task Planning Process Based on ILOG CPLEX
下载PDF
导出
摘要 在实际生产应用中,存在很多需要在规定时间内完成的复杂任务,任务的持续时间、任务之间的先后顺序、任务的优先级等都导致任务规划的过程存在困难。该文提出一种任务规划过程,对给定的具有优先级、时间约束条件的任务实现任务规划过程,达到任务总耗时最小的目标。ILOG公司提供的CPLEX可以用于解决多种线性规划问题。采用ILOG优化引擎嵌套VC来实现任务规划过程的算法。 In actual production applications,there are many complex tasks that need to be completed within the specified time.The duration of tasks,the sequence of tasks,and the priority of tasks all make the process of task planning difficult.This paper proposes a task planning process to achieve the task planning process for a given task with priority and time constraints,and achieve the goal of minimizing the total time-consuming task.CPLEX provided by ILOG can be used to solve a variety of linear programming problems.Use ILOG optimization engine nested VC to realize the algorithm of task planning process.
作者 郑雅倩 ZHENG Yaqian(Wuxi Taihu University,Wuxi 214064,China)
机构地区 无锡太湖学院
出处 《现代信息科技》 2020年第17期152-154,共3页 Modern Information Technology
关键词 ILOG CPLEX 任务规划 线性规划 ILOG CPLEX task planning linear programming
  • 相关文献

参考文献5

二级参考文献20

  • 1周毕文,黄洁萍,李春华.线性规划最优解的探讨及在生产与运作管理中的应用[J].北京理工大学学报(社会科学版),2001,3(4):47-49. 被引量:4
  • 2田俊峰,杨梅.生产企业供应链中产销运作协调研究[J].系统工程理论与实践,2006,26(3):33-38. 被引量:8
  • 3H M Wagner, T M Whitin. Dynamic version of the economic lot size model [J]. Management Science (S0025-1909), 2004, 50(12): 89-96.
  • 4M Florian, M Klein. Deterministic production planning with concave costs and capacity constraints [J]. Management Science (S0025- 1909), 1971, 18(1): 12-20.
  • 5M Florian, J Lensta, A Rinnooy-Kan. Deterministic production planning: Algorithms and complexity [J]. Management Science (S0025-1909), 1980, 26(7): 374-384.
  • 6G Bitran, H Yanasse. Computational complexity of the capacitated lot size problem [J]. Management Science (S0025-1909), 1982, 28(10): 1174-1186.
  • 7N Brahimi, S Dauzere-Peres, N M Najid, A Nordli. Single item lot sizing problems [J]. European Journal of Operational Research (S0377-2217), 2006, 168(1): 1-16.
  • 8ILOG, Inc. CPLEX User's Manual. 2003. ILOG CPLEX 9.0 Reference Manual [DB/OL]. 2003. http://www.ilog.com/.
  • 9M L Fisher. The Lagrangian relaxation method for solving integer programming problems [J]. Management Science (S0025-1909), 1981, 27(1): 1-18.
  • 10A Wagelmans, S Van Hoesel, A Kolen. Economic lot sizing: An O(nlogn) algorithm that runs in linear time in the Wagner-Whitin case[J]. Operations Research (S1526-5463), 1992, 40(1): 145-156.

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部