Hybrid evolutionary algorithm for no-wait flow shops to minimize makespan and total flowtime

被引：0

作者：

Liao, Xiaoping ^{[1
]}

Liu, Yougen ^{[2
]}

Li, Xiaoping ^{[2
]}

机构：

[1] College of Computer and Information Engineering, Hohai University, Nanjing 210098, China

[2] School of Computer Science and Engineering, Southeast University, Nanjing 210096, China

来源：

Journal of Southeast University (English Edition) | 2008年 / 24卷 / 04期

关键词：

Evolutionary algorithms;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：450 / 454

共 50 条

[21] Makespan minimization in no-wait flow shops: A polynomial time approximation scheme
Sviridenko, M
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (02) : 313 - 322
[22] Domain Heuristics for Evolutionary Scheduling of No-Wait Flow Shops
Yeh, Tung-Su
Chiang, Tsung-Che
PROCEEDINGS OF THE IEEE 2019 9TH INTERNATIONAL CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS (CIS) ROBOTICS, AUTOMATION AND MECHATRONICS (RAM) (CIS & RAM 2019), 2019, : 215 - 220
[23] Hybrid Genetic-VNS algorithm with total flowtime minimization for the no-wait flowshop problem
Yang, Ning
Li, Xiao-Ping
Zhu, Jie
Wang, Qian
PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 935 - +
[24] A NO-WAIT FLOWSHOP SCHEDULING HEURISTIC TO MINIMIZE MAKESPAN
RAJENDRAN, C
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (04) : 472 - 478
[25] A new exact algorithm for no-wait job shop problem to minimize makespan
A. Ozolins
Operational Research, 2020, 20 : 2333 - 2363
[26] A new exact algorithm for no-wait job shop problem to minimize makespan
Ozolins, A.
OPERATIONAL RESEARCH, 2020, 20 (04) : 2333 - 2363
[27] New heuristics for no-wait flowshops to minimize makespan
Aldowaisan, T
Allahverdi, A
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) : 1219 - 1231
[28] New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
Ruiz, Ruben
Allahverdi, Ali
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (20) : 5717 - 5738
[29] An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
Nagano, Marcelo Seido
de Almeida, Fernando Siqueira
Miyata, Hugo Hissashi
ENGINEERING OPTIMIZATION, 2021, 53 (08) : 1431 - 1449
[30] A heuristically directed immune algorithm to minimize makespan and total flow time in permutation flow shops
Chakravorty, Arindam
Laha, Dipak
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2017, 93 (9-12): : 3759 - 3776

← 1 2 3 4 5 →