Abstract
In this research, the collation delay (CD) and makespan minimization problem in a mail-order pharmacy automated distribution (MOPAD) system are studied. The MOPAD systems, which are integrated with pharmaceutical auto-dispenser machines, auto-packer machines, and conveyor, are utilized to fulfill the increasing prescription demand in recent years. The motivation of this research is derived from the practical deadlock problem in a MOPAD system of the central fill pharmacies (CFP). Most of the customer orders consist of multiple medications, which need to be collated together before being packaged and shipped. The CD is defined as the fulfillment completion time difference between the first and last medications within the same order, which is a critical factor of the MOPAD systems throughput. When CD is minimized, the makespan often increases. Therefore, alternative scheduling solutions are often needed to balance the CD and makespan in the MOPAD system. This paper presents the trade-off solutions between minimizing CD and the makespan. Three multi-objective genetic algorithms with a three-tuples chromosome design, including Vector Evaluated Genetic Algorithm (VEGA), Multi-Objective Genetic Algorithm (MOGA), and non-dominated sorted genetic algorithm-II (NSGA-II), are implemented and compared under various system settings. Compared to the current implemented longest processing time (LPT) heuristic, three multi-objective genetic algorithms save the CD by 95.67 %, but only increase the makespan by 5.62 % on average. The results also show that the NSGA-II provided the best frontier.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Atallah MJ (1998) Algorithms and theory of computation handbook. CRC press, Boca Raton
Bepko RJ Jr., Moore JR, Coleman JR (2009) Implementation of a pharmacy automation system (robotics) to ensure medication safety at norwalk hospital. Qual Manag Health Care 18(2):103–114
Bhattacharya R, Bandyopadhyay S (2010) Solving conflicting bi-objective facility location problem by nsga ii evolutionary algorithm. Int J Adv Manuf Technol 51(1–4):397–414
Cochran JK, Horng S-M, Fowler JW (2003) A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Comput Oper Res 30(7):1087–1102
Coello CAC (2000) An updated survey of ga-based multiobjective optimization techniques. Association for Computing Machinary Computing Surveys 32(2):109–143
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182–197
Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: Formulation discussion and generalization. In: Genetic Algorithms: Proceedings of the Fifth International Conference, vol 93, pp 416–423, San Mateo
Gholami M, Azizi M (2014) Constrained grinding optimization for time, cost, and surface roughness using nsga-ii. Int J Adv Manuf Technol 73(5-8):981–988
Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning, Addison-wesley Reading Menlo Park
Greb E, Rios M (2009) Robots: The next phase in pharmaceutical automation. Pharm Technol 33(9):38–44
Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2008) Genetic optimization of order scheduling with multiple uncertainties. Expert Syst Appl 35(4):1788–1801
Guo ZX, Wong WK, Li Z, Ren P (2013) Modeling and pareto optimization of multi-objective order scheduling problems in production planning. Comput Ind Eng 64(4):972–986
Jenkins A, Eckel SF (2012) Analyzing methods for improved management of workflow in an outpatient pharmacy setting. Am J Health Syst Pharm 69(11):966–971
Jones DF, Keyvan Mirrazavi S, Mehrdad Tamiz (2002) Multi-objective meta-heuristics: an overview of the current state-of-the-art. Eur J Oper Res 137(1):1–9
Konak A, Coit DW, Smith AE, Multi-objective optimization using genetic algorithms: a tutorial (2006). Reliab Eng Syst Saf 91(9):992–1007
Li D, Won Yoon S (2012) Minimizing fill-time window in central fill pharmacy. In: Industrial and systems engineering research conference (ISERC), Orlando
Li D, Won Yoon S (2012) Simulation based manova analysis of pharmaceutical automation system in central fill pharmacy. In: International conference on industrial engineering and engineering management (IEEM), Hong Kong, China
Li D, Won Yoon S (2014) A novel fll time window minimization problem and adaptive parallel tabu search algorithm in mail-order pharmacy automation system. Int J Prod Res. In press
Li Q, Gong J, Fung RYK, Tang J (2012) Multi-objective optimal cross-training configuration models for an assembly cell using nondominated sorting genetic algorithm-ii. Int J Comput Integr Manuf 25(11):981–995
Liu C-H (2014) Approximate trade-off between minimisation of total weighted tardiness and minimisation of carbon dioxide (co2) emissions in bi-criteria batch scheduling problem. Int J Comput Integr Manuf 27(8):759–771
Liu X, Chao Y, Zhao X, Wang W, Ma Y (2008) Design and application for automated medicine depositing and dispensing system of pharmacy. In: 2008 International conference on computer science and information technology, ICCSIT ’08, pp 332 –336
Mahfoud SW (1992) Crowding and preselection revisited. Parallel problem solving from nature 2:22–36
Ming F, Yi G, Chao Y (2010) Research on the parameter optimization model for the automated storage and retrieval system of pharmacy. In: 2010 International conference on computer application and system modeling (ICCASM), vol 1, pp V1–463–V1–467
Murugan P, Kannan S, Baskar S (2009) Nsga-ii algorithm for multi-objective generation expansion planning problem. Electr Power Syst Res 79(4):622–628
Oswald S, Caldwell R (2007) Dispensing error rate after implementation of an automated pharmacy carousel system. Am J Health Syst Pharm 64(13):1427–1431
Wang X-J, Zhang C-Y, Gao L, Li P-G (2008) A survey and future trend of study on multi-objective scheduling. In: Fourth International Conference on Natural Computation, vol 6, pp 382–391, Jinan. IEEE
Zhao X, Yun C, Liu X, Wang W (2008) Modeling and simulation of the automated pharmacy system. In: 2008 International conference on intelligent computation technology and automation (ICICTA), vol 1, pp 621–625
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mei, K., Li, D., Yoon, S.W. et al. Multi-objective optimization of collation delay and makespan in mail-order pharmacy automated distribution system. Int J Adv Manuf Technol 83, 475–488 (2016). https://doi.org/10.1007/s00170-015-7555-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-015-7555-7