A novel fill-time window minimisation problem and adaptive parallel tabu search algorithm in mail-order pharmacy automation system
- 3 November 2014
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 53 (14) , 4189-4205
Abstract
This paper presents a novel fill-time window (FTW) problem in a mail-order pharmacy automation (MOPA) system. The MOPA system uses a batch process to fulfil and distribute tens of thousands of highly customised prescription orders. It has been utilised to accommodate an increasing prescription volume and pharmacy dispensing productivity. Since the majority of prescription orders consist of multiple medications, the long medications’ waiting time in the collation process will increase the makespan or even cause a production deadlock in extreme cases. To minimise the collation time of multiple medication orders, the FTW is defined as the time difference between the first and last dispensed medications within a prescription order and the FTW problem is introduced as a flexible order scheduling problem by considering makespan as a constraint. To minimise the FTW, an integer mathematical model has been developed to find an optimal production schedule. To solve this NP-hard order scheduling problem efficiently, an adaptive parallel tabu search (APTS) algorithm is proposed. The performance of the proposed algorithm has been experimented with different system parameters. Based on the experimental results, the APTS algorithm yields less FTW than LPT, and less FTW than TS.Keywords
This publication has 21 references indexed in Scilit:
- Analyzing methods for improved management of workflow in an outpatient pharmacy settingAmerican Journal of Health-System Pharmacy, 2012
- Fast and meta-heuristics for common due-date assignment and scheduling on parallel machinesInternational Journal of Production Research, 2012
- Design and application of task administration protocols for collaborative production and service systemsInternational Journal of Production Economics, 2012
- Scheduling just-in-time part supply for mixed-model assembly linesEuropean Journal of Operational Research, 2011
- Implementation of a Pharmacy Automation System (Robotics) to Ensure Medication Safety at Norwalk HospitalQuality Management in Health Care, 2009
- Order Scheduling in an Environment with Dedicated Resources in ParallelJournal of Scheduling, 2005
- Order Scheduling Models: An Overview2005
- Training recurrent neural networks by using parallel tabu search algorithm based on crossover operationEngineering Applications of Artificial Intelligence, 2004
- Parallel flowshop scheduling using Tabu searchInternational Journal of Production Research, 2003
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986