Multi-Strategy Discrete Teaching–Learning-Based Optimization Algorithm to Solve No-Wait Flow-Shop-Scheduling Problem
To address the problems of the single evolutionary approach, decreasing diversity, inhomogeneity, and meaningfulness in the destruction process when the teaching–learning-based optimization (TLBO) algorithm solves the no-wait flow-shop-scheduling problem, the multi-strategy discrete teaching–learnin...
Main Authors: | Jun Li, Xinxin Guo, Qiwen Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-07-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/15/7/1430 |
Similar Items
-
No-Wait Job Shop Scheduling Using a Population-Based Iterated Greedy Algorithm
by: Mingming Xu, et al.
Published: (2021-04-01) -
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
by: Danial Khorasanian, et al.
Published: (2012-11-01) -
Intelligent Optimization Under Multiple Factories: Hybrid FlowShop Scheduling Problem with Blocking ConstraintsUsing an Advanced Iterated Greedy Algorithm
by: Yong Wang, et al.
Published: (2023-12-01) -
A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem
by: Yong Wang, et al.
Published: (2023-05-01) -
Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times
by: BongJoo Jeong, et al.
Published: (2021-11-01)