|
|
|
|
|
Yu-Hung Chang, Chien-Hung Liu and Shingchern D. You
The dynamic flexible job-shop problem (DFJSP) is a realistic and challenging problem that many production plants face. As the product line becomes more complex, the machines may suddenly break down or resume service, so we need a dynamic scheduling frame...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lei Sun, Weimin Shi, Junru Wang, Huimin Mao, Jiajia Tu and Luojun Wang
Production scheduling in a knitting workshop is an important method to improve production efficiency, reduce costs and improve service. In order to achieve a reasonable allocation of parallel machines as well as cooperation between different machines wit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Levente Fazekas, Boldizsár Tüu-Szabó, László T. Kóczy, Olivér Hornyák and Károly Nehéz
Flow-shop scheduling problems are classic examples of multi-resource and multi-operation scheduling problems where the objective is to minimize the makespan. Because of the high complexity and intractability of the problem, apart from some exceptional ca...
ver más
|
|
|
|
|
|
|
|
|
|
|
Toufik Mzili, Ilyass Mzili, Mohammed Essaid Riffi and Gaurav Dhiman
This paper presents a new hybrid algorithm that combines genetic algorithms (GAs) and the optimizing spotted hyena algorithm (SHOA) to solve the production shop scheduling problem. The proposed GA-SHOA algorithm incorporates genetic operators, such as un...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chang-Bae Gil and Jee-Hyong Lee
Manufacturing sites encounter various scheduling problems, which must be dealt with to efficiently manufacture products and reduce costs. With the development of smart factory technology, many elements at manufacturing sites have become unmanned and more...
ver más
|
|
|
|
|
|
|
|
|
|
|
Milos Seda
The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution, and schedulin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Danial Rooyani and Fantahun Defersha
The work in this paper is motivated by a recently published article in which the authors developed an efficient two-stage genetic algorithm for a comprehensive model of a flexible job-shop scheduling problem (FJSP). In this paper, we extend the applicati...
ver más
|
|
|
|
|
|
|
|
|
|
|
Eliana Maria Gonzalez-Neira, Jairo R. Montoya-Torres and Jose-Fernando Jimenez
This paper proposes a hybridized simheuristic approach that couples a greedy randomized adaptive search procedure (GRASP), a Monte Carlo simulation, a Pareto archived evolution strategy (PAES), and an analytic hierarchy process (AHP), in order to solve a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mehrdad Amirghasemi
This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a...
ver más
|
|
|
|
|
|
|
|
|
|
|
BongJoo Jeong, Jun-Hee Han and Ju-Yong Lee
This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to m...
ver más
|
|
|
|
|
|