Integrated blood collection and appointment scheduling

Name: Integrated blood collection and appointment scheduling
Author: Mobasher, A., Ekici, Ali, Özener, Okan Örsan

İsim	Integrated blood collection and appointment scheduling
Yazar	Mobasher, A., Ekici, Ali, Özener, Okan Örsan
Basım Tarihi:	2012
Basım Yeri	- Institute of Industrial Engineers
Konu	Heuristic, Large neighborhood, Maximum blood collection problem
Tür	Belge
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	2-s2.0-84900318059
Kayıt Numarası	0a88bf26-4d07-4e57-9532-6ab258963f58
Lokasyon	Industrial Engineering
Tarih	2012
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	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.

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Integrated blood collection and appointment scheduling

Yazar Mobasher, A., Ekici, Ali, Özener, Okan Örsan

Basım Tarihi 2012

Basım Yeri - Institute of Industrial Engineers

Konu Heuristic, Large neighborhood, Maximum blood collection problem

Tür Belge

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 2-s2.0-84900318059

Kayıt Numarası 0a88bf26-4d07-4e57-9532-6ab258963f58

Lokasyon Industrial Engineering

Tarih 2012

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin 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.