Matrix encoding networks for neural combinatorial optimization
Abstract Machine Learning (ML) can help solve combinatorial optimization (CO) problems
better. A popular approach is to use a neural net to compute on the parameters of a given …
better. A popular approach is to use a neural net to compute on the parameters of a given …
A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems
O Engin, A Güçlü - Applied Soft Computing, 2018 - Elsevier
This paper proposes an effective new hybrid ant colony algorithm based on crossover and
mutation mechanism for no-wait flow shop scheduling with the criterion to minimize the …
mutation mechanism for no-wait flow shop scheduling with the criterion to minimize the …
A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems
Hybrid flowshop scheduling problems include the generalization of flowshops with parallel
machines in some stages. Hybrid flowshop scheduling problems are known to be NP-hard …
machines in some stages. Hybrid flowshop scheduling problems are known to be NP-hard …
A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation
The hybrid flowshop scheduling (HFS) problem with the objective of minimising the
makespan has important applications in a variety of industrial systems. This paper presents …
makespan has important applications in a variety of industrial systems. This paper presents …
A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
A Missaoui, R Ruiz - European Journal of Operational Research, 2022 - Elsevier
Abstract Hybrid Flowshop Scheduling Problems (HFS) are among the most realistic machine
sequencing models there are. These problems deal with the scheduling of a set of jobs …
sequencing models there are. These problems deal with the scheduling of a set of jobs …
An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem
Distributed permutation flow shop scheduling problem (DPFSP) is a newly proposed
scheduling problem, which is a generalisation of classical permutation flowshop scheduling …
scheduling problem, which is a generalisation of classical permutation flowshop scheduling …
An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming
In this paper, the problem of hybrid flowshop hybridizing with lot streaming (HLFS) with the
objective of minimizing the total flow time is addressed. We propose a mathematical model …
objective of minimizing the total flow time is addressed. We propose a mathematical model …
Metaheuristic algorithms for the hybrid flowshop scheduling problem
The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature,
as it has many real-life applications in industry. Even though many solution approaches …
as it has many real-life applications in industry. Even though many solution approaches …
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
In practice due dates usually behave more like intervals rather than specific points in time.
This paper studies hybrid flowshops where jobs, if completed inside a due window, are …
This paper studies hybrid flowshops where jobs, if completed inside a due window, are …
A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem
J Gao, R Chen - International Journal of Computational Intelligence …, 2011 - Taylor & Francis
Distributed Permutation Flowshop Scheduling Problem (DPFSP) is a newly proposed
scheduling problem, which is a generalization of classical permutation flow shop scheduling …
scheduling problem, which is a generalization of classical permutation flow shop scheduling …