Login / Signup
A robust LP-based approach for a dynamic surgical case scheduling problem with sterilisation constraints.
Hasan Al Hasan
Christelle Guéret
David Lemoine
David Rivreau
Published in:
Int. J. Prod. Res. (2024)
Keyphrases
</>
scheduling problem
np hard
setup times
linear arithmetic constraints
flowshop
precedence constraints
single machine
processing times
linear programming
tabu search
constraint programming
minimally invasive surgery
constraint satisfaction
constraint propagation
geometric constraints
minimizing makespan