Mathematical modelling and a meta-heuristic for flexible job shop scheduling

启发式 水准点(测量) 整数规划 模拟退火 调度(生产过程) 作业车间调度 计算机科学 启发式 数学优化 算法 数学 地铁列车时刻表 大地测量学 操作系统 地理
作者
Vahid Roshanaei,Ahmed Azab,Hoda ElMaraghy
出处
期刊:International Journal of Production Research [Informa]
卷期号:51 (20): 6247-6274 被引量:66
标识
DOI:10.1080/00207543.2013.827806
摘要

AbstractThis study develops new solution methodologies for the flexible job shop scheduling problem (F-JSSP). As a first step towards dealing with this complex problem, mathematical modellings have been used; two novel effective position- and sequence-based mixed integer linear programming (MILP) models have been developed to fully characterise operations of the shop floor. The developed MILP models are capable of solving both partially and totally F-JSSPs. Size complexities, solution effectiveness and computational efficiencies of the developed MILPs are numerically explored and comprehensively compared vis-à-vis the makespan optimisation criterion. The acquired results demonstrate that the proposed MILPs, by virtue of its structural efficiencies, outperform the state-of-the-art MILPs in literature. The F-JSSP is strongly NP-hard; hence, it renders even the developed enhanced MILPs inefficient in generating schedules with the desired quality for industrial scale problems. Thus, a meta-heuristic that is a hybrid of Artificial Immune and Simulated Annealing (AISA) Algorithms has been proposed and developed for larger instances of the F-JSSP. Optimality gap is measured through comparison of AISA’s suboptimal solutions with its MILP exact optimal counterparts obtained for small- to medium-size benchmarks of F-JSSP. The AISA’s results were examined further by comparing them with seven of the best-performing meta-heuristics applied to the same benchmark. The performed comparative analysis demonstrated the superiority of the developed AISA algorithm. An industrial problem in a mould- and die-making shop was used for verification.Keywords: schedulingflexible job shopmixed integer linear programminghybrid artificial immune algorithmssimulated annealingsize complexityoptimality gap AcknowledgementsThis research was conducted in the Intelligent Manufacturing Systems Center at the University of Windsor, Canada. Research funding from the Canada Research Chairs program and the Natural Sciences and Engineering Council (NSERC) of Canada are gratefully acknowledged.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
文献搬运工完成签到 ,获得积分10
刚刚
lena完成签到 ,获得积分10
1秒前
5秒前
zz完成签到 ,获得积分10
7秒前
11秒前
13秒前
鹏gg完成签到 ,获得积分10
13秒前
雪花完成签到 ,获得积分10
15秒前
淡如水完成签到 ,获得积分10
17秒前
安安滴滴完成签到 ,获得积分10
19秒前
没用的三轮完成签到,获得积分10
27秒前
32秒前
广發完成签到 ,获得积分10
35秒前
醒略略发布了新的文献求助10
39秒前
43秒前
JJ发布了新的文献求助20
45秒前
汉堡包应助醒略略采纳,获得10
45秒前
狂野水壶发布了新的文献求助10
49秒前
dream完成签到 ,获得积分10
54秒前
asdfqaz完成签到,获得积分10
55秒前
啦啦啦啦完成签到 ,获得积分10
55秒前
t铁核桃1985完成签到 ,获得积分10
56秒前
醒略略完成签到,获得积分10
56秒前
狂野水壶完成签到,获得积分20
57秒前
Singularity应助云生雾霭采纳,获得50
58秒前
多边形完成签到 ,获得积分10
1分钟前
yy完成签到 ,获得积分10
1分钟前
1分钟前
ljz完成签到,获得积分10
1分钟前
去去去去发布了新的文献求助10
1分钟前
充电宝应助JJ采纳,获得10
1分钟前
dearwang完成签到,获得积分10
1分钟前
jbear完成签到 ,获得积分10
1分钟前
三石SUN完成签到 ,获得积分10
1分钟前
1分钟前
大舟Austin完成签到 ,获得积分10
1分钟前
糊涂的青烟完成签到 ,获得积分10
1分钟前
合适醉蝶完成签到 ,获得积分10
1分钟前
1分钟前
感性的道之完成签到 ,获得积分10
1分钟前
高分求助中
The Young builders of New china : the visit of the delegation of the WFDY to the Chinese People's Republic 1000
юрские динозавры восточного забайкалья 800
English Wealden Fossils 700
Chen Hansheng: China’s Last Romantic Revolutionary 500
宽禁带半导体紫外光电探测器 388
Case Research: The Case Writing Process 300
Global Geological Record of Lake Basins 300
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3142849
求助须知:如何正确求助?哪些是违规求助? 2793717
关于积分的说明 7807147
捐赠科研通 2450016
什么是DOI,文献DOI怎么找? 1303576
科研通“疑难数据库(出版商)”最低求助积分说明 627016
版权声明 601350