New hard benchmark for flowshop scheduling problems minimising makespan
From MaRDI portal
Publication:300036
DOI10.1016/j.ejor.2014.07.033zbMath1338.90185OpenAlexW2063345867MaRDI QIDQ300036
Eva Vallada, Rubén Ruiz, Jose M. Framinan
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/63119
Related Items
Constraint guided accelerated search for mixed blocking permutation flowshop scheduling ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ On heuristic solutions for the stochastic flowshop scheduling problem ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes ⋮ An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ \(N\)-NEH+ algorithm for solving permutation flow shop problems ⋮ New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ A cutoff time strategy based on the coupon collector's problem ⋮ On some lower bounds for the permutation flowshop problem ⋮ Shop scheduling in manufacturing environments: a review ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ New benchmark instances for the capacitated vehicle routing problem ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ Makespan preserving flowshop reengineering via blocking constraints ⋮ A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- 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
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- Shifting representation search for hybrid flexible flowline problems
- Benchmarks for shop scheduling problems
- A genetic algorithm for flowshop sequencing
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- Benchmarks for basic scheduling problems
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Flowshop scheduling research after five decades
- 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
- Landscapes, Embedded Paths and Evolutionary Scheduling
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- Search Methodologies
- Fifty years of scheduling: a survey of milestones
- The Lessons of Flowshop Scheduling Research
- 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
This page was built for publication: New hard benchmark for flowshop scheduling problems minimising makespan
