Show simple item record

dc.contributor.authorDesai, Tejas
dc.date.accessioned2010-08-31T04:12:07Z
dc.date.available2010-08-31T04:12:07Z
dc.date.copyright2005
dc.date.issued2010-08-31T04:12:07Z
dc.identifier.urihttp://hdl.handle.net/11718/8206
dc.description.abstractIt is well-known that the demand for services at many if not all hospitals is variable over a given year such that the demand is significantly higher in some months compared to the rest of the months in any given year. This is especially true for surgical departments at many hospitals. Therefore, it is a challenge to staff the surgical departments in such a way that the demand for surgeries throughout a year is met without creating significant over- or under-staffing at any point in a given year. In other words, an optimal level of staffing is sought so that the staff is not significantly over- or under- utilized at any point in a given year. In this paper, we consider an algorithmic approach of arriving at such an optimal level of staffing given some practical constraints. We apply this approach to the surgery department of the paying section of the Aravind Eye Hospital in Madurai, India.en
dc.language.isoenen
dc.subjectAravind Eye Hospitalen
dc.titleOn the Optimal Staffing of Surgeons and Efficient Scheduling of Surgeriesen
dc.typeCases and Notesen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record