Hybrid model and logic-based decomposition algorithms on JSSP

被引：0

作者：

Zhu, Xing-Hui ^{[1
]}

Zhu, Jin-Fu ^{[1
]}

Jiang, Tao ^{[1
]}

机构：

[1] Coll. of Civil Aviation, Nanjing Univ. of Aeronautics and Astronautics, Nanjing 210016, China

来源：

Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics | 2008年 / 30卷 / 09期

关键词：

Constraint theory - Problem solving - Computer circuits - Job shop scheduling;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The job-shop scheduling problem (JSSP) is a typically hard non-polynomial problem (NP-Hard) and has been widely researched by scholars. Firstly, the complementary strengths of MIP and CP are applied to solve the problems that are intractable if solving them using either of the two methods alone. Then the MIP/CP hybrid model and logic-based decomposition algorithms are put forward. Finally, some examples illustrate that the model and algorithms are effective in combinational optimization.

引用

页码：1697 / 1699