|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Mingming Xu, Shuning Zhang and Guanlong Deng
When no-wait constraint holds in job shops, a job has to be processed with no waiting time from the first to the last operation, and the start time of a job is greatly restricted. Using key elements of the iterated greedy algorithm, this paper proposes a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chauvet, F; Proth, J-M; Wardi, Y
Pág. 60 - 69
|
|
|
|
|
|