This paper describes the job sequencing (JS) problem and the evolutionary programming (EP) approach, and proposes an evolutionary algorithm (EA) that solves the JS problem. It also compares EA with the following
The flexible job shop scheduling problem with parallel batch processing operation (FJSP_PBPO) in this study is motivated by real-world scenarios observed in electronic product testing workshops. This research aims to tackle the deficiency of effective me
In this research, we propose a modified iterated greedy algorithm (MIG) to reduce the cost by consuming less CPU time. MIG provides a simple and easily applicable method that can compete with more complex meta-heuristics. The proposed algorithm MIG consists of two phases, each phase is derived...
Job shop scheduling primarily involves decision-making on production batch and production sequencing. For example, Wang, ZC et al. established a constrained hybrid flow shop scheduling model by considering a real-world scenario. And a discrete artificial ant colony algorithm is designed to solve the...
A multi-objective genetic algorithm based on a simplex lattice design is proposed to solve this mixed-integer programming model effectively. From the features of this problem, the corresponding encoding/decoding method, fitness function, and crossover/mutation operators are designed. The results of ...
the inclusion of PBPO in the FJSP_PBPO renders the traditional ROV method unsuitable. To address this, a novel segmented conversion algorithm is developed to convert the real vector\(X_{p} = [RVT \, RVM]\)into integer vector\(X_{p}^{\prime} = [IVT,IVM]\). This algorithm introduces...
In the first stage, the algorithm optimized the makespan using deterministic data. Then, in the second stage, it focused on a bi-objective function by integrating machine assignments and operation sequencing with the expected machine breakdown in the decoding space. While in most works, breakdown ...
The general distributed flexible job shop scheduling problem (DFJSP) involves three sub-problems: (1) operation-sequencing, (2) job-to-cell assignment, and (3) operation-to-machine assignment. Due to the variety of operations involved in large-scale and complex workpieces, it is difficult for...
Using as a base, several extensions can be described by aligning the different prefixes. For example, refers to a problem where jobs may have non-linear routes where the sequencing of non-connected operations should be chosen and where operations require multiple resources (and not a single ...
Job shop scheduling primarily involves decision-making on production batch and production sequencing. For example, Wang, ZC et al. established a constrained hybrid flow shop scheduling model by considering a real-world scenario. And a discrete artificial ant colony algorithm is designed to solve the...