Application research of mixed integer programming and constraint programming to the order planning problem

In many practical situations, jobs can be grouped into different batches based on processing similarities, while a sequence independent setup time is required when jobs are switched from one batch to another on a single machine. In this study, we propose the 0–1 mixed integer programming and constraint programming model to solve this paper, the optimal objective of which is to minimize the maximum lateness of the order. With regard to the middle–small size problem, two models' optimal solutions are tested and compared by using the OPL Studio. The simulation results show that constraint programming is much more efficient, and the results could be used to evaluate the effectiveness of the other heuristic algorithm.