Abstract
This paper presents the multi-objective optimization problem (MOP) of minimizing collation delays and the makespan in mail-order pharmacy automation (MOPA) systems. MOPA is a high-throughput make-to-order (MTO) manufacturing system designed to handle thousands of prescription orders every day. Prescription orders are highly customized, and most of them consist of multiple medications that need to be collated before packaging and shipping. The completion time difference between the first and the last medications within the same order is defined as the order collation delay. This research mainly investigates the effects of machine flexibility and the proportion of multi-medication orders on the total collation delays. To solve this NP-hard problem, a genetic algorithm with a min-max Pareto objective function is used. The GA performance is compared to two industry heuristics: the longest processing time (LPT) and the least total workload (LTW). Experimental results indicate that a fully dedicated machine environment has 80 % more total collation delays as compared to a fully flexible machine environment and 25 % more total collation delays as compared to a multi-purpose machine environment. Experimental results also indicate that the GA can achieve the optimal makespan in most cases, while minimizing the total collation delays by 96 % when compared to LPT and LTW.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Belegundu A, Chandrupatla T (2011) Optimization concepts and applications in engineering Cambridge University Press
Blocher J, Chhajed D (1996) The customer order lead-time problem on parallel machines. Naval Research Logistics (NRL) 43(5):629–654
Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol. 16 John Wiley & Sons
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
Guo Z, Wong W, Li Z, Ren P (2013) Modeling and pareto optimization of multi-objective order scheduling problems in production planning. Computers & Industrial Engineering 64(4):972–986
Ioannou G, Dimitriou S (2012) Lead time estimation in mrp/erp for make-to-order manufacturing systems. Int J Prod Econ 139(2):551–563
Julien FM, Magazine MJ (1990) Scheduling customer orders: an alternative production scheduling approach. Journal of Manufacturing and Operations Management 3(3):177–199
Leung JY, Li CL (2008) Scheduling with processing set restrictions: a survey. Int J Prod Econ 116 (2):345–364
Leung JY, Li H, Pinedo M (2005) Order scheduling in an environment with dedicated resources in parallel. J Sched 8(5):355–386
Leung JY, Li H, Pinedo M, Kendall G, Burke E, Petrovic S, Gendreau M (2005) Order scheduling models: an overview. Springer, U.S
Leung JY, Li H, Pinedo M (2006) Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel. Naval Research Logistics (NRL) 53(4):243–260
Leung JY, Li H, Pinedo M (2008) Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time. Ann Oper Res 159(1):107–123
Li D, Yoon SW (2012) Minimizing fill-time window in central fill pharmacy. In: Industrial and systems engineering research conference (ISERC), orlando, FL
Li D, Yoon SW (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, Yoon SW (2015) A novel fill-time window minimisation problem and adaptive parallel tabu search algorithm in mail-order pharmacy automation system. Int J Prod Res 53(14):4189–4205
Li H, Womer K (2012) Optimizing the supply chain configuration for make-to-order manufacturing. Eur J Oper Res 221(1): 118–128
Mei K, Li D, Yoon SW, Ryu J (2015) Multi-objective optimization of collation delay and makespan in mail-order pharmacy automated distribution system. Int J Adv Manuf Technol:1–14
Pinedo M (2012) Scheduling: theory, algorithms, and systems Springer Science & Business Media
Piya S, Al-Hinai N (2015) Production planning for make-to-order flow shop system under hierarchical workforce environment. In: Transactions on engineering technologies, pp 317–330. Springer
Unlu Y, Mason S (2010) Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Comput Ind Eng 58(4):785–800
Vairaktarakis G, Cai X (2003) The value of processing flexibility in multipurpose machines. IIE Trans 35 (8):763–774
Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur J Oper Res 211(3):612–622
Wang B, Guan Z, Chen Y, Shao X, Jin M, Zhang C (2013) An assemble-to-order production planning with the integration of order scheduling and mixed-model sequencing. Frontiers of Mechanical Engineering 8(2):137–145
Wang G, Cheng T (2007) Customer order scheduling to minimize total weighted completion time. Omega 35(5):623–626
Weng ZK (1996) Manufacturing lead times, system utilization rates and lead-time-related demand. Eur J Oper Res 89(2):259–268
Xu X, Ma Y, Zhou Z, Zhao Y (2015) Customer order scheduling on unrelated parallel machines to minimize total completion time. IEEE Trans Autom Sci Eng 12(1):244–257
Yang J (2005) The complexity of customer order scheduling problems on parallel machines. Comput Oper Res 32(7): 1921–1939
Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. Eidgenössische Technische Hochschule zürich (ETH), Institut für Technische Informatik und Kommunikationsnetze (TIK)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dauod, H., Li, D., Yoon, S.W. et al. Multi-objective optimization of the order scheduling problem in mail-order pharmacy automation systems. Int J Adv Manuf Technol 99, 73–83 (2018). https://doi.org/10.1007/s00170-016-9123-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-016-9123-1