A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problem

计算机科学 作业车间调度 元启发式 数学优化 人口 水准点(测量) 调度(生产过程) 算法 数学 大地测量学 地铁列车时刻表 操作系统 社会学 人口学 地理
作者
Víctor M. Valenzuela-Alcaraz,María de los Ángeles Cosío-León,A. Danisa Romero-Ocaño,Carlos A. Brizuela
出处
期刊:Expert Systems With Applications [Elsevier BV]
卷期号:194: 116498-116498 被引量:14
标识
DOI:10.1016/j.eswa.2022.116498
摘要

The no-wait job shop is an extension of the well-known job shop scheduling subject to the constraint that the operations of any job, once started, must be processed immediately, one after the other, until the completion of the job. The problem is NP-hard and exact methods can only solve small instances. In the last two decades of advances on this problem, one aspect became central for the success of metaheuristics to tackle it, namely the decomposition of solution into two parts: sequencing and timetabling. Most of these metaheuristics use a permutation to represent the sequencing part, while the timetabling part uses specific rules that differentiate one approach from the other. The main contribution of this work is the proposal of a cooperative coevolutionary algorithm where the sequencing and the timetabling parts interact with each other to evolve quasi-optimal sequencing and timetabling decisions. To this aim, the algorithm co-evolves a population of permutations with a population of binary chains. The permutation decides the sequencing while each bit in the binary chain decides whether or not a job is shifted to the left-most position on its corresponding machine. Therefore, the whole binary chain defines a timetabling rule that is automatically optimized during the evolution process. The algorithm also includes one-step perturbation mechanisms that help improve the solution quality. The proposed algorithm is tested on a set of benchmark instances to compare it with seven state-of-the-art methods. Computational experiments show that the proposed algorithm produces competitive results, furthermore, new best values for four instances are obtained.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
2秒前
英姑应助幼汁汁鬼鬼采纳,获得30
2秒前
xy完成签到 ,获得积分10
4秒前
5秒前
6秒前
焦糖拿铁完成签到,获得积分20
6秒前
852应助Dr.coco采纳,获得10
7秒前
8秒前
9秒前
热心玉兰发布了新的文献求助10
9秒前
中和皇极应助iday采纳,获得10
10秒前
7777777完成签到,获得积分10
10秒前
11秒前
13秒前
14秒前
思维隋发布了新的文献求助10
16秒前
幼汁汁鬼鬼完成签到,获得积分10
18秒前
20秒前
21秒前
21秒前
Prillision发布了新的文献求助10
24秒前
健哥完成签到,获得积分10
24秒前
catherine完成签到,获得积分10
25秒前
Rondab应助Zzzhou23采纳,获得30
25秒前
完美世界应助felix采纳,获得10
26秒前
27秒前
共享精神应助微笑小天鹅采纳,获得10
27秒前
28秒前
典雅的半青完成签到,获得积分10
30秒前
顺心绝山完成签到,获得积分10
32秒前
zy关注了科研通微信公众号
40秒前
40秒前
41秒前
浔xxx完成签到,获得积分20
42秒前
Mine发布了新的文献求助30
45秒前
Baili发布了新的文献求助10
47秒前
聪明伶俐的猪猪侠完成签到,获得积分10
48秒前
寒冷半雪完成签到,获得积分10
48秒前
Zjx发布了新的文献求助10
48秒前
hhhhhhhhhh完成签到 ,获得积分10
49秒前
高分求助中
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
A new approach to the extrapolation of accelerated life test data 1000
Indomethacinのヒトにおける経皮吸収 400
基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 370
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
Robot-supported joining of reinforcement textiles with one-sided sewing heads 320
Aktuelle Entwicklungen in der linguistischen Forschung 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3993371
求助须知:如何正确求助?哪些是违规求助? 3534027
关于积分的说明 11264545
捐赠科研通 3273794
什么是DOI,文献DOI怎么找? 1806170
邀请新用户注册赠送积分活动 883016
科研通“疑难数据库(出版商)”最低求助积分说明 809652