Chutamas Pontrakul
ABSTRACT
In the pharmaceutical industry, tablets film coating planning concerns a finding of coating sequences on parallel machines such that both the completion time and number of tardy jobs are minimized. This problem is made more difficult when a wide variety of drugs is produced as changing from one to another drug requires considerably long period of cleaning and setup times - these times also vary depending on the previously coated drug. We show that this problem could be transformed into the Vehicle Routing Problem with Time Window (VRPTW), where a variable arc exchange heuristic - whose concept is based on the Variable Neighborhood Search (VNS) - is devised to solve such a problem. Our proposed heuristic is a two-phase one, where the initial solutions are constructed from easy-to-implement dispatching heuristics, i.e. Earliest Due Date (EDD) and Longest Processing Time (LPT). The initial solution is then iteratively improved by a series of local-search operators, including 2OPT, RELOCATION, and SWAP. The results from our proposed heuristic is comparatively good, when compared to those of the optimization model in terms of solution quality as the gap is less than 5% for instances of 20 orders; but, it requires much less computation time, which is crucial from a practical point of view.
- Dumas, Y., Desrosiers, J., Gelinas, E. and Solomon, M. 1995. An Optimal Algorithm for the Traveling Salesman Problem with Time Windows. Operations Research. 43, 2 (Apr. 1995), 367--371. Google Scholar
Digital Library
- Hamzadayi, A. and Yildiz, G. 2017. Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times. Computers & Industrial Engineering. 106 (Feb. 1999), 287--298. Google ScholarDigital Library
- Jarumaneeroj, P. and Kunaporn, S. 2017. A variable neighbourhood search approach for crew transportation problems. In Proceedings of the Industrial Engineering and Applications (Nagoya, Japan, April 21-23, 2017). ICIEA '04. IEEE, 229--233.Google Scholar
- Karabulut, K. and Tasgetiren, F. 2014. A variable iterated greedy algorithm for the traveling salesman problem with time windows. Information Sciences. 279 (Sep. 2014), 383--395.Google Scholar
- Kirci, P. 2016. An optimization algorithm for a capacitated vehicle routing problem with time windows. Indian Academy of Sciences. 41, 5 (May. 2016), 519--529.Google Scholar
- Kitisook, K. and Jarumaneeroj, P. 2017. A variable arc exchange heuristics for float glass manufacturing problems. In Proceedings of the Industrial Engineering and Applications (Nagoya, Japan, April 21-23, 2017). ICIEA '04. IEEE, 50--54.Google Scholar
- Kumar, V.S., Thansekhar, M.R., Saravanan R. and Amali S.M. 2014. Solving Multi-objective Vehicle Routing Problem with Time Windows by FAGA. Procedia Engineering. 97 (Dec. 2014), 2176--2185.Google Scholar
- Lee, C.H., Liao, C.J. and Chung T.P. 2014. Scheduling with multi-attribute setup times on two identical parallel machines. International Journal of Production Economics. 153 (Feb. 2014), 130--138.Google Scholar
- Pinedo, M. 2008. Scheduling: Theory, Algorithms, and Systems. Springer Publishing Company, NY. Google ScholarDigital Library
- Remington, J.P. and Beringer, P. 2005. Remington: The Science and Practice of Pharmacy. Lippincott Williams & Wilkins Company, Philadelphia, PA.Google Scholar
- Sørensen, R. Oral solid dosage - surviving in a new reality. {Online}. 2017. Available at: https://www.nne.com.html {2018, May 28}.Google Scholar
- Suzzi, D., Radl, S. and G. Khinast J. 2010. Local analysis of the tablet coating process: Impact of operation conditions on film quality. Chemical Engineering Science. 65, 21 (Nov. 2010), 5699--5715.Google ScholarCross Ref
- Vincent, B. Duhamel, C. Ren, L. and Tchernev, N. 2016. An efficient heuristic for scheduling on identical parallel machines to minimize total tardiness. IFAC-PaperOnline., 49, 12 (Aug. 2016), 1737--1742.Google Scholar
- Yeh, C., Chuang, C. and Lee, C. 2014. Uniform parallel machine scheduling with resource consumption constraint. Applied Mathematical Modelling. 39, 8 (Apr. 2014), 2131--2138.Google Scholar
Index Terms
- Heuristic Based Scheduling for Tablets Film Coating Process
Recommendations
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
Given a set of jobs with associated processing times, and a set of identical machines, each of which can process at most one job at a time, the parallel machine scheduling problem is to assign each job to exactly one machine so as to minimize the ...
Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
This work proposes a hybrid metaheuristic (HMH) approach which integrates several features from tabu search (TS), simulated annealing (SA) and variable neighbourhood search (VNS) in a new configurable scheduling algorithm. In particular, either a ...
A tabu search algorithm for parallel machine total tardiness problem
In this study, we consider the problem of scheduling a set of independent jobs with sequence dependent setups on a set of uniform parallel machines such that total tardiness is minimized. Jobs have nonidentical due dates and arrival times. A tabu search ...
Comments