4.7 Article

Mathematical models and benchmarking for the fuzzy job shop scheduling problem

期刊

COMPUTERS & INDUSTRIAL ENGINEERING
卷 183, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2023.109454

关键词

Scheduling; Job shop; Fuzzy numbers; Mathematical models; Benchmark; Metaheuristics

向作者/读者索取更多资源

The fuzzy job shop scheduling problem with makespan minimisation has been extensively studied, but little work has been done on proposing and solving mathematical models for this problem. This has resulted in a lack of understanding of the problem's hardness and absence of reliable lower and upper bounds. In this study, two mathematical models are proposed and solved, and a thorough analysis on scalability is carried out. The use of different solvers improves known bounds and enables a structural characterization of the instances' hardness.
The fuzzy job shop scheduling problem with makespan minimisation has received considerable attention over the last decade. Different sets of benchmark instances have been made available, and many metaheuristic solutions and corresponding upper bounds of the optimal makespan have been given for these instances in different publications. However, unlike the deterministic case, very little work has been invested in proposing and solving mathematical models for the fuzzy problem. This has resulted both in a lack of a good characterisation of the hardness of existing benchmark instances and in the absence of reliable lower and upper bounds for the makespan. In consequence, it is difficult, if not impossible to properly assess and compare new proposals of exact or approximate solving methods, thus hindering progress in this field. In this work we intend to fill this gap by proposing and solving two mathematical models, a mixed integer linear programming model and a constraint programming model. A thorough analysis on the scalability of solving these mathematical models with commercial solvers is carried out. A state-of-the-art metaheuristic algorithm from the literature is also used as reference point for a better understanding of the results. Using solvers of different nature allows us to improve known upper and lower bounds for all existing instances, and certify optimality for many of them for the first time. It also enables us to structurally characterise the instances' hardness beyond their size.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据