By Topic

Programming for economic lot-sizes with precedences between items

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

1 Author(s)

The model of this paper results in a near-optimal solution to a production, inventory, and work-force planning problem where the number of items is large compared to the number of facilities and time periods in the planning horizon. It extends the work of Dzielinski and Gomory3 to assembly production. Based on the product structures, constraints are generated to maintain the precedence relations among items and solution methods are discussed. Dantzig-Wolfe decomposition is applied to the program and it is noted that generalized upper bounding may also be used. A suboptimal procedure that does a level-by-level óptimization is presented, and it may be satisfactory in many applications. The optimal procedure involves a consideration of all levels simultaneously.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Systems Journal  (Volume:10 ,  Issue: 3 )