By Topic

Machine-oriented decentralized scheduling method using Lagrangian decomposition and coordination 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
$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

4 Author(s)
T. Nishi ; Dept. of Electr. & Electron. Eng., Okayama Univ., Japan ; M. Konishi ; S. Hasebe ; I. Hashimoto

In the conventional Lagrangian relaxation approach, the scheduling problems are decomposed into job-level sub-problems or operation-level sub-problems. However, these approaches are not applicable to the flowshop problems with the changeover cost which depends on the sequence of operations. In this paper, we propose a machine-oriented decomposition method for the flowshop problems using the Lagrangian decomposition and coordination technique. In the proposed method, each sub-problem for single machine is solved by the simulated annealing method. The solutions of the sub-problems are used to generate a feasible schedule by a heuristic procedure. The effectiveness of the proposed method is verified by comparing the results of the example problems solved by the proposed method with those solved by the conventional method. Furthermore, it has been shown that the proposed approach is easily applicable to the flow hop problem with resource constrains minimizing the changeover costs and due date penalties.

Published in:

Robotics and Automation, 2002. Proceedings. ICRA '02. IEEE International Conference on  (Volume:4 )

Date of Conference: