A Differential-Based Harmony Search Algorithm With Variable Neighborhood Search for Job Shop Scheduling Problem and Its Runtime Analysis
Job shop scheduling problem (JSSP) has drawn a lot of attention as it is one of the vital combinational optimization problems in manufacturing systems. In this paper, a differential-based harmony search (DHS) algorithm with variable neighborhood search (VNS) is proposed for solving JSSP with the obj...
Main Authors: | Fuqing Zhao, Shuo Qin, Guoqiang Yang, Weimin Ma, Chuck Zhang, Houbin Song |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8506369/ |
Similar Items
-
A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem
by: Nayeli Jazmin Escamilla Serna, et al.
Published: (2021-05-01) -
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
by: Gao, Kai Zhou, et al.
Published: (2016) -
Equilibrium Optimizer and Slime Mould Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem
by: Yuanfei Wei, et al.
Published: (2022-11-01) -
Hybrid Harmony Search for Stochastic Scheduling of Chemotherapy Outpatient Appointments
by: Roberto Rosario Corsini, et al.
Published: (2022-11-01) -
An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem
by: Kongfu Hu, et al.
Published: (2023-09-01)