Reduction of permutation flowshop problems to single machine problems using machine dominance relations
From MaRDI portal
Publication:1652025
DOI10.1016/j.cor.2016.07.009zbMath1391.90259OpenAlexW2465589296MaRDI QIDQ1652025
Jose M. Framinan, Victor Fernandez-Viagas
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.009
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
Cites Work
- Unnamed Item
- New hard benchmark for flowshop scheduling problems minimising makespan
- 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
- Variability of completion time differences in permutation flow shop scheduling
- 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
- Makespan minimization in machine dominated flowshop
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- Benchmarks for shop scheduling problems
- A genetic algorithm for flowshop sequencing
- Flowshop scheduling with dominant machines
- Nonpreemptive flowshop scheduling with machine dominance
- A comprehensive review and evaluation of permutation flowshop heuristics
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Benchmarks for basic scheduling problems
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Optimal two- and three-stage production schedules with setup times included
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- The Complexity of Flowshop and Jobshop Scheduling
- Ordonnancements à contraintes disjonctives
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Flowshop-scheduling problems with makespan criterion: a review
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- Scheduling
This page was built for publication: Reduction of permutation flowshop problems to single machine problems using machine dominance relations
