MIP-Based Approaches for Solving Scheduling Problems with Batch Processing Machines
In this paper, we address the scheduling problem involving batch processing machines. The presented mixed integer programming formulation first provides an elegant model for the prob lem under study. Furthermore, it enables solutions to the problem instances beyond the capability of exact methods developed so far. In order to alleviate computational burden, we propose MIP-based approaches which balance solution quality and computing time.
Scheduling Batching decisions Mized integer programming
Udo Buscher Liji Shen
Industrial Management,Department of Business Administration and Economics,Dresden University of Technology, 01062 Dresden,Germany
国际会议
张家界
英文
132-139
2009-09-20(万方平台首次上网日期,不代表论文的发表时间)