New hard benchmark for flowshop scheduling problems minimising makespan
From MaRDI portal
(Redirected from Publication:300036)
Recommendations
- Benchmarks for basic scheduling problems
- Benchmarks for shop scheduling problems
- A computational study of the permutation flow shop problem based on a tight lower bound
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
Cites work
- scientific article; zbMATH DE number 1500526 (Why is no real title available?)
- scientific article; zbMATH DE number 2243399 (Why is no real title available?)
- A comprehensive review and evaluation of permutation flowshop heuristics
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A computational study of the permutation flow shop problem based on a tight lower bound
- A genetic algorithm for flowshop sequencing
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An improved NEH heuristic to minimize makespan in permutation flow shops
- An improved NEH-based heuristic for the permutation flowshop problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Benchmarks for basic scheduling problems
- Benchmarks for shop scheduling problems
- Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- Fifty years of scheduling: a survey of milestones
- Flowshop scheduling research after five decades
- Flowshop-scheduling problems with makespan criterion: a review
- Landscapes, embedded paths and evolutionary scheduling
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Ordonnancements à contraintes disjonctives
- Search Methodologies
- Shifting representation search for hybrid flexible flowline problems
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- The Complexity of Flowshop and Jobshop Scheduling
- The Lessons of Flowshop Scheduling Research
Cited in
(37)- On some lower bounds for the permutation flowshop problem
- Makespan preserving flowshop reengineering via blocking constraints
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
- Revisiting simulated annealing: a component-based analysis
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty
- \(N\)-NEH+ algorithm for solving permutation flow shop problems
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- New benchmark instances for the capacitated vehicle routing problem
- Flowshop-scheduling problems with makespan criterion: a review
- On heuristic solutions for the stochastic flowshop scheduling problem
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- A review and classification on distributed permutation flowshop scheduling problems
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- Shop scheduling in manufacturing environments: a review
- Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users
- A cutoff time strategy based on the coupon collector's problem
- 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
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- Iterative beam search algorithms for the permutation flowshop
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
This page was built for publication: New hard benchmark for flowshop scheduling problems minimising makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300036)
