A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
From MaRDI portal
Publication:6069764
Cites work
- A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
- A biased random-key genetic algorithm for single-round divisible load scheduling
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- A biased random-key genetic algorithm for the minimization of open stacks problem
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- A biased-randomized metaheuristic for the capacitated location routing problem
- A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains
- A branch and bound algorithm for the two-stage assembly scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An ILS heuristic for the ship scheduling problem: application in the oil industry
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- 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
- Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
- Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
- Extending time-to-target plots to multiple instances
- Flowshop scheduling research after five decades
- Flowshop-scheduling problems with makespan criterion: a review
- Iterated local search and simulated annealing algorithms for the inventory routing problem
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems
- The ALGACEA‐1 method for the capacitated vehicle routing problem
- The distributed permutation flowshop scheduling problem
- The two-stage assembly scheduling problem to minimize total completion time with setup times
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
Cited in
(11)- A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- 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
- Iterated local search, iterated greedy and applications
- A simheuristic-based algorithm for the stochastic long-term maintenance scheduling problem
- An effective two-stage heuristic for scheduling the distributed assembly flowshops with sequence dependent setup times
- N-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling
- Research on construction and application for the model of multistage job shop scheduling problem
This page was built for publication: A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069764)
