By Topic

Scheduling products with bills of materials using an improved Lagrangian relaxation technique

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

2 Author(s)
Czerwinski, C.S. ; Dept. of Electr. & Syst. Eng., Connecticut Univ., Storrs, CT, USA ; Luh, P.B.

A bill of materials specifies the sequence in which parts are to be processed and assembled in order to manufacture a deliverable product. In practice, a bill of materials may be quite complex, involving hundreds of parts to be processed on a number of limited resources, making scheduling difficult. This has forced many practitioners to turn to Material Requirements Planning (MRP) and heuristic rules to perform scheduling. These methods are seldom integrated, resulting in unreliable completion times for products and, hence, low customer satisfaction. This paper addresses the issue of integrally scheduling parts that are related through a bill of materials for the purpose of improving the on-time performance of products as well as reducing work-in-process (WIP) inventory. The technique presented here is based on an existing Lagrangian relaxation (LR) approach for the scheduling of independent parts in a job shop. An auxiliary problem formulation with a modified subgradient method is adopted to improve the computation time of the existing LR approach. This improved LR approach allows the bill of material constraints to be considered directly in the problem formulation

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:10 ,  Issue: 2 )