An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem

doi:10.1016/j.asoc.2017.08.020

Return

An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem

2017-12-01

PRE

DOI：10.1016/j.asoc.2017.08.020

Original

Original request for help

Save

Abstract

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.

Keywords:

No-wait flow shop scheduling

Probabilistic teaching phase

Learning phase

Local search

Minimizing makespan

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.