返回
An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem
DOI:10.1016/j.asoc.2017.08.020.png)
摘要
En 中文
The no-wait flow shop scheduling problem (NWFSSP) performs an important function in the manufacturing industry. Inspired by the overall process of teaching-learning, an extended framework of meta-heuristic based on the teaching-learning process is proposed, which consists of four parts, i.e. previewing before class, teaching phase, learning phase, reviewing after class. This paper implements a hybrid meta-heuristic based on probabilistic teaching-learning mechanism (mPTLM) to solve the NWFSSP with the makespan criterion. In previewing before class, an initial method that combines a modified Nawaz-Enscore-Ham (NEH) heuristic and the opposition-based learning (OBL) is introduced. In teaching phase, the Gaussian distribution is employed as the teacher to guide learners to search more promising areas. In learning phase, this paper presents a new means of communication with crossover. In reviewing after class, an improved speed-up random insert local search based on simulated annealing (SA) is developed to enhance the local searching ability. The computational results and comparisons based on Reeves, Taillard and VRF's benchmarks demonstrate the effectiveness of mPTLM for solving the NWFSSP. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
No-wait flow shop scheduling
Probabilistic teaching phase
Learning phase
Local search
Minimizing makespan
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
暂无机构信息
引用论文
An effective teaching-learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time
NEUROCOMPUTING
IF6.5
A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops匈牙利基于惩罚的构造算法,可最大程度地减少无等待流水车间的完工时间和总流水时间

