A Genetic Algorithm For The Flexible Job-Shop Scheduling Problem

A genetic algorithm for the Flexible Job …

https://www.sciencedirect.com/science/article/pii/S0305054807000524

Genetic algorithm for the flexible job-shop scheduling …

https://ieeexplore.ieee.org/document/1244425/

The flexible job shop scheduling problem (FJSP) is known in the literature as one of the hardest combinatorial optimization problems and presents many objectives to be optimized. In this way, we aim to solve such a problem according to a set of some criteria, which characterize the feasible solutions of such a problem.

A genetic algorithm for flexible job-shop scheduling

https://ieeexplore.ieee.org/document/772512

The paper presents a new genetic algorithm to solve the flexible job-shop scheduling problem with makespan criterion. The representation of solutions for the problem by chromosomes consists of two parts. The first part defines the routing policy and the second part the sequence of the operations on each machine.

A new genetic algorithm for flexible job-shop scheduling …

https://link.springer.com/article/10.1007/s12206-015-0242-7

Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and …

A multistart biased random key genetic algorithm for the …

https://onlinelibrary.wiley.com/doi/10.1111/itor.12878

Good-quality solutions are efficiently found by an operation-based multistart biased random key genetic algorithm (BRKGA) coupled with greedy heuristics to select the machine processing each operation and the vehicles transporting the jobs to operations.

Genetic Algorithm for Flexible Job Shop Scheduling

https://www.iaeng.org/publication/WCE2013/WCE2013_pp703-708.pdf

the distributed and flexible job-shop scheduling problem”, European Journal of Operational Research, vol. 200, no. 2, pp. 395-408, 2010. [9] C. Gutiérrez and I. García-Magariño, “Modular design of a hybrid genetic algorithm for a flexible job–shop scheduling problem”, Knowledge-Based Systems, vol. 24, no. 1, pp. 102-112, 2011.

Flexible job-shop scheduling problem by genetic algorithm

https://onlinelibrary.wiley.com/doi/full/10.1002/eej.21194

Abstract The Flexible Job-shop Scheduling Problem is an expansion of the traditional Job-shop Scheduling Problem in which an operation can be processed by one or more machines. The purpose of this problem is to look for the smallest makespan.

A Hybrid Genetic Algorithm for Flexible Job Shop …

https://link.springer.com/chapter/10.1007/978-981-16-6320-8_40

In this study, an improved hybrid genetic algorithm is firstly proposed to solve the flexible job shop scheduling problem. Three operators, namely tournament plus selection, partly cyclic crossover and inversion exchange mutation are used to improve the traditional genetic algorithm.

Solving flexible job shop scheduling problems with

https://pubmed.ncbi.nlm.nih.gov/30947423/

The FJSP problem is NP-hard. Then, an improved genetic algorithm is used to solve the problem. In the decoding process, an operation left shift insertion method according to the problem characteristics is proposed to decode the chromosomes in order to get the active scheduling solutions.