Dynamic Programming for Single Batching Machine with Total Weighted Completion Time

摘要：

The problem of total weighted completion time for single batching machine is an open problem until now. Accordingly, heuristics is very useful to the problem. We construct a nonlinear mathematical model for the problem with unbounded batching machine. A dynamic programming is also carried for the problem, which is proved to be at most 2 times of the optimal solution later. With an example, we show that the bound is tight.

关键词： batching machine dynamic programming worst case

作者: Daguang Feng Peng Liu Suwen Wu Bo Liu

作者单位: Science of Institute, Shenyang Agricultural University, Shenyang, China, 110866 School of Management, Shenyang University of Technology, Shenyang, 110870, China

会议类型: 国际会议

会议名称: The 22nd China Control and Decision Conference(2010年中国控制与决策会议)

会议地点: 徐州

会议语种:英文

页码: 3798-3799

在线出版日期: 2010-05-26（万方平台首次上网日期，不代表论文的发表时间）