scispace - formally typeset
Journal ArticleDOI

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

Reads0
Chats0
About
This article is published in International Transactions in Operational Research.The article was published on 2020-05-01. It has received 47 citations till now. The article focuses on the topics: Iterated local search & Flow shop scheduling.

read more

Citations
More filters
Journal ArticleDOI

A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem

TL;DR: In this paper, a cooperative water wave optimization algorithm, named CWWO, is proposed to address the distributed assembly no-idle flow shop scheduling problem with the goal of minimizing the maximum assembly completion time.
Journal ArticleDOI

A genetic programming hyper-heuristic for the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times

TL;DR: A genetic programming hyper heuristic (GP-HH) algorithm is proposed to solve the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times (DAPFSP-SDST) and the objective of makespan minimization.
Journal ArticleDOI

The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery

TL;DR: A novel distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery (DAPFSP-FABD) can help cross-regional companies coordinate the scheduling of production and transportation and enhance the performance of supply chains.
Journal ArticleDOI

A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems

TL;DR: A Reinforcement Learning Iterated Local Search meta-heuristic, based on the implementation of a Q-Learning Variable Neighborhood Search, to provide heuristically good solutions at the cost of low computational expenses is proposed.
Journal ArticleDOI

The green vehicle routing problem with capacitated alternative fuel stations

TL;DR: In this article, two Mixed Integer Linear Programming (MILP) formulations, one based on arc-variables and another based on path-variants, were proposed to reduce the computational time required to solve the problem, and two variants of an exact cutting planes method were proposed.
References
More filters
Journal ArticleDOI

A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
Journal ArticleDOI

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

TL;DR: This work presents a new iterated greedy algorithm that applies two phases iteratively, named destruction, were some jobs are eliminated from the incumbent solution, and construction, where the eliminated jobs are reinserted into the sequence using the well known NEH construction heuristic.
Book ChapterDOI

Iterated Local Search: Framework and Applications

TL;DR: The purpose here is to give an accessible description of the underlying principles of iterated local search and a discussion of the main aspects that need to be taken into account for a successful application of it.
Journal ArticleDOI

A comprehensive review and evaluation of permutation flowshop heuristics

TL;DR: This work presents a comparison of 25 methods, ranging from the classical Johnson's algorithm or dispatching rules to the most recent metaheuristics, including tabu search, simulated annealing, genetic algorithms, iterated local search and hybrid techniques, for the well-known permutation flowshop problem with the makespan criterion.
Journal ArticleDOI

Assembly system design and operations for product variety

TL;DR: A review of the state of the art research in the areas of assembly system design, planning and operations in the presence of product variety is presented in this article, where methods for assembly representation, sequence generation and assembly line balancing are reviewed and summarized.
Related Papers (5)