期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 102, 期 -, 页码 160-165出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2016.11.001
关键词
FJSP; PBM; CP; MIP; Valid inequalities
A flexible job-shop scheduling problem (FJSP) with parallel batch processing machines (PBM) is addressed. First, we exhibit an enhanced mixed integer programming (MIP) model. Secondly, several valid inequalities are added for a reduction of solution space. Finally, we propose a constraint programming (CP) model, which is likely to be superior in many scheduling problems. Those different approaches are tested on a set of common problem instances from the literature. Computational results find three key lessons: the proposed MIP model significantly reduces computational time compared to the original model from the literature, the valid inequalities further reduce a computational time, and CP incomparably outperforms all three MIP models. Authors also discuss future adoption opportunities of CP, which has not got well deserved attention by OR/IE practitioners yet. (C) 2016 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据