An Enhanced Two-Level Metaheuristic Algorithm with Adaptive Hybrid Neighborhood Structures for the Job-Shop Scheduling Problem
For solving the job-shop scheduling problem (JSP), this paper proposes a novel two-level metaheuristic algorithm, where its upper-level algorithm controls the input parameters of its lower-level algorithm. The lower-level algorithm is a local search algorithm searching for an optimal JSP solution wi...
Saved in:
Main Author: | Pisut Pongchairerks |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2020/3489209 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem
by: Pisut Pongchairerks
Published: (2019-01-01) -
A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose Machines
by: Pisut Pongchairerks
Published: (2022-01-01) -
Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem
by: Pisut Pongchairerks
Published: (2016-01-01) -
A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems
by: Le Zhang, et al.
Published: (2014-01-01) -
Preference learning based deep reinforcement learning for flexible job shop scheduling problem
by: Xinning Liu, et al.
Published: (2025-01-01)