Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
type: Item
instance of: scholarly article
title: Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
zbMATH Open document ID: 1502.90078
author: Fernando Luis Rossi
author: Marcelo Seido Nagano
published in: OR Spectrum
publication date: 2022-11-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7622466
zbMATH Keywords: flowshop
zbMATH Keywords: mixed no-idle
zbMATH Keywords: heuristics
zbMATH Keywords: metaheuristics
MaRDI profile type: Publication
full work available at URL: s00291-022-00678-9
OpenAlex ID: W4229073751
cites work: A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
cites work: An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion
cites work: A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
cites work: An improved NEH-based heuristic for the permutation flowshop problem
cites work: Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
cites work: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
cites work: A new set of high-performing heuristics to minimise flowtime in permutation flowshops
cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
cites work: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
cites work: Comparison of heuristics for flowtime minimisation in permutation flowshops
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Flowshop scheduling research after five decades
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: On no-wait and no-idle flow shops with makespan criterion
cites work: An improved NEH heuristic to minimize makespan in permutation flow shops
cites work: An empirical analysis of the optimality rate of flow shop heuristics
cites work: Q2997911
cites work: Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
cites work: A high quality solution constructive heuristic for flow shop sequencing
cites work: Flowshop/no-idle scheduling to minimise the mean flowtime
cites work: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
cites work: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
cites work: A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
cites work: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
cites work: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
cites work: Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
DOI: 10.1007/S00291-022-00678-9
description: scientific article; zbMATH DE number 7622466