Iterative beam search algorithms for the permutation flowshop
From MaRDI portal
Abstract: We study an iterative beam search algorithm for the permutation flowshop (makespan and flowtime minimization). This algorithm combines branching strategies inspired by recent branch-and-bounds and a guidance strategy inspired by the LR heuristic. It obtains competitive results, reports many new-best-so-far solutions on the VFR benchmark (makespan minimization) and the Taillard benchmark (flowtime minimization) without using any NEH-based branching or iterative-greedy strategy. The source code is available at: https://gitlab.com/librallu/cats-pfsp.
Recommendations
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Cites work
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A computational study of the permutation flow shop problem based on a tight lower bound
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- A high quality solution constructive heuristic for flow shop sequencing
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- An adaptive branching rule for the permutation flow-shop problem
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- An exact parallel method for a bi-objective permutation flowshop problem
- An improved NEH heuristic to minimize makespan in permutation flow shops
- An improved NEH-based heuristic for the permutation flowshop problem
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- Benchmarks for basic scheduling problems
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Flowshop-scheduling problems with makespan criterion: a review
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Local search methods for the flowshop scheduling problem with flowtime minimization
- New hard benchmark for flowshop scheduling problems minimising makespan
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some efficient heuristic methods for the flow shop sequencing problem
- The permutation flow shop with buffers: A tabu search approach
- Two branch and bound algorithms for the permutation flow shop problem
Cited in
(5)- Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
- DOGS-PFSP
- A tree search heuristic for the resource constrained project scheduling problem with transfer times
This page was built for publication: Iterative beam search algorithms for the permutation flowshop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140159)
