An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
From MaRDI portal
(Redirected from Publication:1652233)
Recommendations
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Benchmarks for basic scheduling problems
- Equation of state calculations by fast computing machines
- Heuristics for large constrained vehicle routing problems
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Matheuristics
- Minimizing Total Tardiness on One Machine is NP-Hard
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Optimal two- and three-stage production schedules with set-up time included
- Some efficient heuristic methods for the flow shop sequencing problem
- The Complexity of Flowshop and Jobshop Scheduling
Cited in
(33)- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- Iterative beam search algorithms for the permutation flowshop
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Automatic algorithm design for hybrid flowshop scheduling problems
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
- Stochastic local search and parameters recommendation: a case study on flowshop problems
- Evaluating the impact of grammar complexity in automatic algorithm design
- Flowshop with additional resources during setups: mathematical models and a GRASP algorithm
- Population-based iterated greedy algorithm for the S-labeling problem
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- Mip-based local search for permutation flowshop scheduling with makespan objective
- Iterated local search, iterated greedy and applications
- Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling
- Job-shop scheduling problem with limited input buffers: mathematical models and solution methods
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
This page was built for publication: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652233)
