A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
type: Item
instance of: scholarly article
title: A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
zbMATH Open document ID: 1391.90260
author: Victor Fernandez-Viagas
author: Jose M. Framinan
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: https://idus.us.es/handle//11441/95250
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 6901382
zbMATH Keywords: scheduling
zbMATH Keywords: flowshop
zbMATH Keywords: heuristics
zbMATH Keywords: flowtime
zbMATH Keywords: PFSP
zbMATH Keywords: beam search
zbMATH Keywords: total completion time
MaRDI profile type: Publication
OpenAlex ID: W2563465816
cites work: New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
cites work: Tabu search for total tardiness minimization in flowshop scheduling problems
cites work: A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
cites work: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
cites work: An improved NEH-based heuristic for the permutation flowshop problem
cites work: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
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 review and classification of heuristics for permutation flow-shop scheduling with makespan objective
cites work: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
cites work: Manufacturing Scheduling Systems
cites work: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
cites work: Comparison of heuristics for flowtime minimisation in permutation flowshops
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Q4187195
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
cites work: Local search methods for the flowshop scheduling problem with flowtime minimization
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: Flowshop-scheduling problems with makespan criterion: a review
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: Job shop scheduling with beam search
cites work: Benchmarks for basic scheduling problems
cites work: Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
cites work: Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
Wikidata QID: Q56524121
DOI: 10.1016/J.COR.2016.12.020
DBLP publication ID: journals/cor/Fernandez-Viagas17a
Recommended article: Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Recommended article: New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
Recommended article: Iterative beam search algorithms for the permutation flowshop
Recommended article: Q4862352
Recommended article: A new constructive heuristic for the flowshop scheduling problem
Recommended article: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
Recommended article: Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
Recommended article: A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
Recommended article: Comparison of heuristics for flowtime minimisation in permutation flowshops
description: scientific article; zbMATH DE number 6901382