|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Pavel V. Matrenin
Planning tasks are important in construction, manufacturing, logistics, and education. At the same time, scheduling problems belong to the class of NP-hard optimization problems. Ant colony algorithm optimization is one of the most common swarm intellige...
ver más
|
|
|
|
|
|
|
|
|
|
|
Marvin Carl May, Alexander Albers, Marc David Fischer, Florian Mayerhofer, Louis Schäfer and Gisela Lanza
Currently, manufacturing is characterized by increasing complexity both on the technical and organizational levels. Thus, more complex and intelligent production control methods are developed in order to remain competitive and achieve operational excelle...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xiaolin Gu, Ming Huang and Xu Liang
For solving the complex flexible job-shop scheduling problem, an improved genetic algorithm with adaptive variable neighborhood search (IGA-AVNS) is proposed. The improved genetic algorithm first uses a hybrid method combining operation sequence (OS) ran...
ver más
|
|
|
|
|
|