Optimal sizing of an automated dispensing cabinet under adjacency constraints


Book chapter


Khalid Hachemi, Didier Gourc, François Marmier
Healthcare Systems: Challenges and Opportunities, Wiley Online Library, 2022, pp. 35--48


Read
Cite

Cite

APA   Click to copy
Hachemi, K., Gourc, D., & Marmier, F. (2022). Optimal sizing of an automated dispensing cabinet under adjacency constraints. In Healthcare Systems: Challenges and Opportunities (pp. 35–48). Wiley Online Library. https://doi.org/10.1002/9781119902614.ch3


Chicago/Turabian   Click to copy
Hachemi, Khalid, Didier Gourc, and François Marmier. “Optimal Sizing of an Automated Dispensing Cabinet under Adjacency Constraints.” In Healthcare Systems: Challenges and Opportunities, 35–48. Wiley Online Library, 2022.


MLA   Click to copy
Hachemi, Khalid, et al. “Optimal Sizing of an Automated Dispensing Cabinet under Adjacency Constraints.” Healthcare Systems: Challenges and Opportunities, Wiley Online Library, 2022, pp. 35–48, doi:10.1002/9781119902614.ch3.


BibTeX   Click to copy

@inbook{hachemi2022a,
  title = {Optimal sizing of an automated dispensing cabinet under adjacency constraints},
  year = {2022},
  journal = {Healthcare Systems: Challenges and Opportunities},
  pages = {35--48},
  publisher = {Wiley Online Library},
  doi = {10.1002/9781119902614.ch3},
  author = {Hachemi, Khalid and Gourc, Didier and Marmier, François}
}

Summary

The three main phases of the medication-use process are prescription, dispensing and administration. When properly utilized, automated dispensing cabinets can dramatically reduce medication selection errors in comparison to manual dispensing. In this chapter, the authors give the description of the automated dispensing cabinet and the drug allocation problem, as well as the notation and definitions used in the mathematical formulation. They develop an algebraic model for the computation of boundary conditions and the formulation of the maximum permissive target problem. A full-size numerical application is also given. The authors develop an algorithm capable of predicting the non-existence of an acceptable assignment according to an incompatibility matrix. This makes it possible to provide decision support for the resizing of drawers or the relaxation of incompatibility constraints by incrementing the binarization threshold. 





Follow this website


You need to create an Owlstown account to follow this website.


Sign up

Already an Owlstown member?

Log in