Multi-objective constraint optimization in mail-order pharmacy automated distribution system

In this research, we study a scheduling problem in mail-order pharmacy automated distribution (MOPAD) system. In MOPAD scheduling, two kinds of objective: the collation delay (CD) and makespan, should be considered and in the previous study of some of authors three kinds of genetic algorithms (GA) are applied and evaluated. In this paper, we apply constraint programming (CP) for the scheduling problem. We proposed a CP formulation of the problem and evaluated through computational experiments. The results show that the proposed method is effective for small-scale problem but further study is required to compare with GA methods in large-scale problems.