By Topic

A lower and upper bound guided nested partitions method for solving capacitated multi-level production planning problems

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
$33 $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

2 Author(s)
Tao Wu ; Department of Industrial and Systems Engineering, University of Wisconsin-Madison, 53706, USA ; Leyuan Shi

This paper considers the capacitated multi-level production planning problem with the consideration of backorders. Demand for each item is deterministic in each level and in each period with a given horizon of T periods. The objective is to minimize the total cost that includes setup, inventory holding, backlogging, and overtime cost. For each period, the demand must be satisfied without exceeding capacities. To achieve high quality solutions for this class of production planning problems, we develop a lower and upper bound guided nested partitions method. The optimization method effectively utilizes domain knowledge guided by both lower and upper bound solutions, and then provides an efficient partitioning and sampling strategy. Consequently, in the approach most of the search is kept around the most promising regions capable of leading to good solutions. Extensive computational tests show that our proposed heuristic approach provides good solution results based on benchmark problems.

Published in:

Automation Science and Engineering (CASE), 2011 IEEE Conference on

Date of Conference:

24-27 Aug. 2011