A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
From MaRDI portal
(Redirected from Publication:340272)
Recommendations
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- An iterated local search for a re-entrant flow shop scheduling problem
- A local search method for permutation flow shop scheduling
- An efficient local search for minimizing completion time variance in permutation flow shops
- Local search methods for the flowshop scheduling problem with flowtime minimization
- An iterated local search algorithm for the lot-streaming flow shop scheduling problem
- Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
Cited in
(17)- An efficient local search algorithm for minimum positive influence dominating set problem
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE)
- A local search method for permutation flow shop scheduling
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Using the method of conditional expectations to supply an improved starting point for CCLS
This page was built for publication: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340272)
