Browsing by Author "Mobasher, A."

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Placeholder
    ArticlePublicationMetadata only
    Coordinating collection and appointment scheduling operations at the blood donation sites
    (Elsevier, 2015-09) Mobasher, A.; Ekici, Ali; Özener, Okan Örsan; Industrial Engineering; EKİCİ, Ali; ÖZENER, Okan Örsan
    According to the regulations imposed by the U.S. Food and Drug Administration and the American Association of Blood Banks, in order to extract platelets, donated blood units have to be processed at a processing center within six hours of donation time. In this paper, considering this processing time requirement of donated blood units for platelet production we study collection and appointment scheduling operations at the blood donation sites. Specifically, given the blood donation network of a blood collection organization, we try to coordinate pickup and appointment schedules at the blood donation sites to maximize platelet production. We call the problem under consideration Integrated Collection and Appointment Scheduling Problem. We first provide a mixed integer linear programming model for the problem. Then, we propose a heuristic algorithm called Integer Programming Based Algorithm. We perform a computational study to test the performance of the proposed model and algorithm in terms of solution quality and computational efficiency on the instances from Gulf Coast Regional Blood Center located in Houston, TX.
  • Placeholder
    Conference paperPublicationMetadata only
    Integrated blood collection and appointment scheduling
    (Institute of Industrial Engineers, 2012) Mobasher, A.; Ekici, Ali; Özener, Okan Örsan; Industrial Engineering; ÖZENER, Okan Örsan; EKİCİ, Ali
    Considering 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.