A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764): Difference between revisions

Latest revision as of 18:09, 30 December 2024

scientific article; zbMATH DE number 7767488

Language	Label	Description	Also known as
English	A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem	scientific article; zbMATH DE number 7767488

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

0 references

0 references

International Transactions in Operational Research

0 references

publication date

17 November 2023

0 references

zbMATH Keywords

permutation flow-shop scheduling

0 references

metaheuristic

0 references

assembly system

0 references

distributed manufacturing system

0 references

iterated local search

0 references

biased randomization

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1111/itor.12719

0 references

cites work

Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times

0 references

The two-stage assembly scheduling problem to minimize total completion time with setup times

0 references

Iterated local search and simulated annealing algorithms for the inventory routing problem

0 references

An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls

0 references

A biased random-key genetic algorithm for single-round divisible load scheduling

0 references

A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems

0 references

An ILS heuristic for the ship scheduling problem: application in the oil industry

0 references

A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls

0 references

An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

0 references

A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains

0 references

Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility

0 references

The ALGACEA‐1 method for the capacitated vehicle routing problem

0 references

A review and classification of heuristics for permutation flow-shop scheduling with makespan objective

0 references

A biased random-key genetic algorithm for the minimization of open stacks problem

0 references

Flowshop scheduling research after five decades

0 references

A branch and bound algorithm for the two-stage assembly scheduling problem

0 references

Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues

0 references

Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem

0 references

Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem

0 references

Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem

0 references

The distributed permutation flowshop scheduling problem

0 references

A scatter search algorithm for the distributed permutation flowshop scheduling problem

0 references

A biased random-key genetic algorithm for the maximum quasi-clique problem

0 references

The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

0 references

A biased‐randomized metaheuristic for the capacitated location routing problem

0 references

Extending time‐to‐target plots to multiple instances

0 references

Flowshop-scheduling problems with makespan criterion: a review

0 references

A comprehensive review and evaluation of permutation flowshop heuristics

0 references

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

0 references

Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

0 references

Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6069764

@@ Property / DOI @@
-.1111/itor.12719
@@ Property / DOI: 10.1111/itor.12719 / rank @@
-Normal rank
@@ Property / DOI @@
+.1111/ITOR.12719
@@ Property / DOI: 10.1111/ITOR.12719 / rank @@
+Normal rank