A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem

DOI10.1111/itor.12719OpenAlexW2971620318WikidataQ127282981 ScholiaQ127282981MaRDI QIDQ6069764

Paola Festa, Daniele Ferone, Sara Hatami, Angel A. Juan, Unnamed Author

Publication date: 17 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12719

zbMATH Keywords

metaheuristicassembly systemiterated local searchdistributed manufacturing systempermutation flow-shop schedulingbiased randomization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (6)

A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ Agile optimization for a real‐time facility location problem in Internet of Vehicles networks ⋮ Scheduling with day shifts and breaks ⋮ Short‐term scheduling with machine calibration ⋮ A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints ⋮ Research on construction and application for the model of multistage job shop scheduling problem

Cites Work

• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
• 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
• The two-stage assembly scheduling problem to minimize total completion time with setup times
• The distributed permutation flowshop scheduling problem
• A branch and bound algorithm for the two-stage assembly scheduling problem
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems
• A comprehensive review and evaluation of permutation flowshop heuristics
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• Flowshop scheduling research after five decades
• Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
• A biased random-key genetic algorithm for the minimization of open stacks problem
• A biased random-key genetic algorithm for single-round divisible load scheduling
• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
• The ALGACEA‐1 method for the capacitated vehicle routing problem
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Extending time‐to‐target plots to multiple instances
• Iterated local search and simulated annealing algorithms for the inventory routing problem
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
• A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
• A biased‐randomized metaheuristic for the capacitated location routing problem
• Flowshop-scheduling problems with makespan criterion: a review
• An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
• 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
• Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
• An ILS heuristic for the ship scheduling problem: application in the oil industry

This page was built for publication: A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem