Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Arnauld Hanset"'
Publikováno v:
Logistique & Management. 19:29-42
La litterature ne manque pas d’articles traitant de problemes presentant la complexite de la gestion d’un bloc operatoire, aussi bien en termes de dimensionnement que de planification et d’ordonnancement. Tous ces problemes ont leurs specificit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9845333860b38bad19455ad64a2fab3
https://doi.org/10.1080/12507970.2011.11516986
https://doi.org/10.1080/12507970.2011.11516986
Publikováno v:
Decision Support Systems
Decision Support Systems, Elsevier, 2013, 55 (2), pp.650-659. ⟨10.1016/j.dss.2012.10.019⟩
Decision Support Systems, Elsevier, 2013, 55 (2), pp.650-659. ⟨10.1016/j.dss.2012.10.019⟩
International audience; Optimizing the daily operating room schedule can be problematic because of the many constraints that need to be taken into account, and solving this issue within a reasonable time span is difficult. The originality of the pres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50588cb656b9a040da5c8b4c5c7c6367
https://hal-uphf.archives-ouvertes.fr/hal-03472186
https://hal-uphf.archives-ouvertes.fr/hal-03472186
Publikováno v:
2010 IEEE Workshop on Health Care Management (WHCM).
The daily operating rooms scheduling is a highly constrained problem. It is also hard to find an optimal solution or at least high quality solutions. To solve this scheduling problem, we use the “expressive power” of the constraint programming pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce6824cfd4034f5f729891d033fcd7b8
https://doi.org/10.1109/whcm.2010.5441245
https://doi.org/10.1109/whcm.2010.5441245
Publikováno v:
International Journal of Advanced Operations Management. 1:363
In the context of limited time decision making, this paper presents the results of a tabu search method applied to a discrete-continuous highly constrained industrial scheduling problem. The aim of this work is to generate the most suitable schedulin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a680e613f692926cb901c8fdd3302a98
https://doi.org/10.1504/ijaom.2009.031250
https://doi.org/10.1504/ijaom.2009.031250