Show simple item record

dc.contributor.authorMobasher, A.
dc.contributor.authorEkici, Ali
dc.contributor.authorÖzener, Okan Örsan
dc.date.accessioned2016-02-16T10:26:05Z
dc.date.available2016-02-16T10:26:05Z
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/10679/2594
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.language.isoengen_US
dc.publisherInstitute of Industrial Engineers
dc.relation.ispartof62nd Annual Conference and Expo of the Institute of Industrial Engineers 2012
dc.rightsrestrictedAccess
dc.titleIntegrated blood collection and appointment schedulingen_US
dc.typeConference paperen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID21945
dc.contributor.ozuauthorÖzener, Okan Örsan
dc.identifier.startpage788
dc.identifier.endpage796
dc.subject.keywordsHeuristic
dc.subject.keywordsLarge neighborhood
dc.subject.keywordsMaximum blood collection problem
dc.identifier.scopusSCOPUS:2-s2.0-84900318059
dc.contributor.authorMale1


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


Share this page