|
|
|
|
|
Bae-Seon Park and Hak-Tae Lee
This paper demonstrates the effectiveness of the Extended First-Come, First-Served (EFCFS) scheduler for integrated arrival and departure scheduling by comparing the scheduling results with the recorded operational data at Incheon International Airport (...
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
|
|
|
|
|
|
|
|
|
Amin Rahimi, Seyed Mojtaba Hejazi, Mostafa Zandieh and Mirpouya Mirmozaffari
In this paper, the problem of finding an assignment of ?n? surgeries to be presented in one of ?m? identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed. Since ORs are among NP-hard optimization problems, ...
ver más
|
|
|
|
|
|
|
|
|
Guozhe Yang, Qingze Tan, Zhiqiang Tian, Xingyu Jiang, Keqiang Chen, Yitao Lu, Weijun Liu and Peisheng Yuan
To cope with the problems of poor matching between processing characteristics and manufacturing resources, low production efficiency, and the hard-to-meet dynamic and changeable model requirements in multi-variety and small batch aerospace enterprises, a...
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
|
|
|
|