By Topic

Dynamic programming for single batching machine with total weighted completion time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Daguang Feng ; Sci. of Inst., Shenyang Agric. Univ., Shenyang, China ; Peng Liu ; Suwen Wu ; Bo Liu

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.

Published in:

Control and Decision Conference (CCDC), 2010 Chinese

Date of Conference:

26-28 May 2010