In this paper a mixed-integer linear programming (MILP) model is presented to minimize makespan of single-stage multiproduct parallel batch production with sequence dependent changeovers. The computational inefficiency and suboptimal problems are addressed by the tight and rigorous formulation of the proposed model. Subtours (subcycles) are eliminated simultaneously so that the optimal solution is obtained in one step. The proposed model is tested with two examples. The results show that the model obtains the global optimal solutions with significant improvement in solution time.
['Yingzong Liang', 'Chi Wai Hui']
Simultaneous subtour elimination model for single-stage multiproduct parallel batch scheduling with sequence dependent changeovers