arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.5832math.OC
收藏

减少连续时间排序问题的MIP公式中转换约束的数目

Reducing the Number of Changeover Constraints in a MIP Formulation of a Continuous-Time Scheduling Problem

Pavel A. Borisovsky, Anton V. Eremeev, Josef Kallrath

摘要:

针对短期生产调度问题中出现的混合整数规划问题,提出了一种新的转换约束公式。新的模型需要更少的约束比原来的配方,这往往会导致更短的计算时间的MIP求解器。此外,如果给出转换任务的时间窗口,新的公式更具灵活性。

英文摘要:

In this paper, we develop a new formulation of changeover constraints for mixed integer programming problem (MIP) that emerges in solving a short-term production scheduling problem. The new model requires fewer constraints than the original formulation and this often leads to shorter computation time of a MIP solver. Besides that, the new formulation is more flexible if the time windows for changeover tasks are given.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑