A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
From MaRDI portal
Publication:1652234
DOI10.1016/j.cor.2016.12.020zbMath1391.90260OpenAlexW2563465816WikidataQ56524121 ScholiaQ56524121MaRDI QIDQ1652234
Victor Fernandez-Viagas, Jose M. Framinan
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/95250
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (7)
Iterative beam search algorithms for the permutation flowshop ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ The risk-averse traveling repairman problem with profits ⋮ 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
Cites Work
- Unnamed Item
- 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
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An improved NEH-based heuristic for the permutation flowshop problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Tabu search for total tardiness minimization in flowshop scheduling problems
- A comprehensive review and evaluation of permutation flowshop heuristics
- Job shop scheduling with beam search
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Benchmarks for basic scheduling problems
- 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
- Optimal two- and three-stage production schedules with setup times included
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- The Complexity of Flowshop and Jobshop Scheduling
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Manufacturing Scheduling Systems
- Flowshop-scheduling problems with makespan criterion: a review
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
