Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
From MaRDI portal
Publication:2099337
DOI10.1007/S00291-022-00678-9zbMATH Open1502.90078OpenAlexW4229073751MaRDI QIDQ2099337FDOQ2099337
Authors: Fernando Luis Rossi, Marcelo Seido Nagano 
Publication date: 23 November 2022
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-022-00678-9
Recommendations
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal two- and three-stage production schedules with set-up time included
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Flowshop scheduling research after five decades
- An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- An improved NEH-based heuristic for the permutation flowshop problem
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- An empirical analysis of the optimality rate of flow shop heuristics
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- On recent modifications and extensions of the NEH heuristic for flow shop sequencing
- Flowshop/no-idle scheduling to minimise the mean flowtime
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- A high quality solution constructive heuristic for flow shop sequencing
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- On no-wait and no-idle flow shops with makespan criterion
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
Cited In (6)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
- A branch-and-bound approach to the no-idle flowshop scheduling problem
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
- A systematic literature review on no-idle flow shop scheduling problem
This page was built for publication: Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099337)
