An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems
From MaRDI portal
Publication:6065137
DOI10.3934/jimo.2023070MaRDI QIDQ6065137
Cai Zhao, Hongqiang Zhang, Lianghong Wu, Qing Xiao, Cili Zuo
Publication date: 11 December 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
permutation flow shopcrow search algorithmpopulation initializationadaptive dynamic neighborhoodnawaz-enscore-ham
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Natural language processing (68T50)
Cites Work
- Unnamed Item
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An improved NEH-based heuristic for the permutation flowshop problem
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under time-of-use tariff
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- GSA: A gravitational search algorithm
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Optimal two- and three-stage production schedules with setup times included
- Firefly Algorithms for Multimodal Optimization
- The Complexity of Flowshop and Jobshop Scheduling
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Flowshop-scheduling problems with makespan criterion: a review
- Handbook of metaheuristics
This page was built for publication: An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems
