Cart (Loading....) | Create Account
Close category search window
 

A macro-level scheduling method using Lagrangian relaxation

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

6 Author(s)
Yuanhui Zhang ; Oracle Corp., Redwood Shores, CA, USA ; Luh, P.B. ; Narimatsu, K. ; Moriya, T.
more authors

In this paper, a macro-level scheduling method is developed to provide high-level planning support for factories with multiple coordinating cells. To model the problem with manageable complexity, detailed operations of a product within a cell are aggregated as a single operation whose processing time is related to the amount of resources allocated. “Overload variables” are introduced and penalized in the objective function. The goal is to properly allocate resources, efficiently handle complicated process plans, and coordinate cells to ensure on-time delivery, low working-in-process inventory, and small resource overload. The formulation obtained is “separable” and can be effectively decomposed by using Lagrangian relaxation. A combined backward and forward dynamic programming (BFDP) method is developed to solve a product sub-problem after a novel transformation of its process plan. The BFDP is further simplified and solved approximately

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:17 ,  Issue: 1 )

Date of Publication:

Feb 2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.