An effective new heuristic algorithm for solving permutation flow shop scheduling problem
From MaRDI portal
Publication:5103873
DOI10.22108/toc.2021.126406.1795OpenAlexW3171676708MaRDI QIDQ5103873
Publication date: 9 September 2022
Full work available at URL: https://doaj.org/article/f0cf18864d584f7db911595ed2011842
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- New hard benchmark for flowshop scheduling problems minimising makespan
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- Some efficient heuristic methods for the flow shop sequencing problem
- A new constructive heuristic for the flowshop scheduling problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A comprehensive review and evaluation of permutation flowshop heuristics
- A new heuristic for the n-job, M-machine flow-shop problem
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- Fifty years of scheduling: a survey of milestones
- Solutions to the Constrained Flowshop Sequencing Problem
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- Flowshop-scheduling problems with makespan criterion: a review
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
This page was built for publication: An effective new heuristic algorithm for solving permutation flow shop scheduling problem
