Show simple item record

dc.contributor.authorMobasher, A.
dc.contributor.authorEkici, Ali
dc.contributor.authorÖzener, Okan Örsan
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractConsidering the processing requirements of donated blood, we study an integrated blood collection and appointment scheduling problem. We develop a mixed integer programming model to maximize the amount of donated blood that can be delivered to the processing center before spoilage as well as determine the schedule of donation appointments. Since the problem complexity and the computational time of MIP formulation is exponentially increasing by including more donation sites, we propose an insertion/saving heuristic algorithm to find a good feasible solution and develop a large neighborhood search method to improve the solution further.
dc.publisherInstitute of Industrial Engineers
dc.relation.ispartof62nd Annual Conference and Expo of the Institute of Industrial Engineers 2012
dc.titleIntegrated blood collection and appointment schedulingen_US
dc.typeConference paperen_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID(ORCID 0000-0002-9291-1877 & YÖK ID 21945) Özener, Örsan
dc.contributor.authorID(ORCID 0000-0002-9627-4780 & YÖK ID 124801) Ekici, Ali
dc.contributor.ozuauthorÖzener, Okan Örsan
dc.contributor.ozuauthorEkici, Ali
dc.subject.keywordsLarge neighborhood
dc.subject.keywordsMaximum blood collection problem
dc.relation.publicationcategoryConference Paper - International - Institutional Academic Staff

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Share this page