Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
From MaRDI portal
Publication:4979992
DOI10.1111/itor.12028zbMath1291.90095OpenAlexW1975355037MaRDI QIDQ4979992
Manuel Mateo, Rachel Luo, Angel A. Juan, Quim Castella, Helena R. Lourenço
Publication date: 20 June 2014
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10230/45862
schedulingmetaheuristicsiterated local searchflow-shop problembiased randomized heuristicsparallelizable algorithmsparameters setting
Related Items (18)
A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times ⋮ A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ A multi-agent based cooperative approach to scheduling and routing ⋮ Solving permutation flow shop scheduling problem with sequence-independent setup time ⋮ Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility ⋮ A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Designing e‐commerce supply chains: a stochastic facility–location approach ⋮ Using horizontal cooperation concepts in integrated routing and facility‐location decisions ⋮ Research on m‐machine flow shop scheduling with truncated learning effects ⋮ An ILS heuristic for the ship scheduling problem: application in the oil industry ⋮ Approaching the rank aggregation problem by local search-based metaheuristics ⋮ Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times ⋮ On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Flow shop scheduling problem with position-dependent processing times ⋮ Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
Uses Software
Cites Work
- Unnamed Item
- MO-TRIBES, an adaptive multiobjective particle swarm optimization algorithm
- Metaheuristics in combinatorial optimization
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- A new heuristic method for the flow shop sequencing problem
- A genetic algorithm for flowshop sequencing
- New heuristics for no-wait flowshops to minimize makespan.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Parallel hybrid heuristics for the permutation flow shop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- Greedy randomized adaptive search procedures
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- An Evaluation of Flow Shop Sequencing Heuristics
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- A guide to vehicle routing heuristics
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- Flowshop-scheduling problems with makespan criterion: a review
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
