By Topic

A Decomposition Method with Cut Generation for Simultaneous Production Scheduling and Routing for multiple AGVs

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

4 Author(s)

Conventional methods for simultaneous production scheduling and routing problem have hierarchical decomposition scheme where production scheduling problem and routing problem are separately solved due to computational complexity. We propose a novel decomposition method with cut generation. The entire problem is decomposed into a upper level subproblem for production scheduling and task assignment problem and a lower level subproblem for collision-free routing of multiple AGVs. The novel idea of the proposed method is the upper level subproblem which is solved by using Lagrangian relaxation technique incorporating cuts generated from a solution of the lower level subproblem. The algorithm solves successively the upper level problem and the lower level problem until a near-optimal solution for original problem is derived. The effectiveness of the proposed method is investigated from numerical experiments.

Published in:

Automation Science and Engineering, 2007. CASE 2007. IEEE International Conference on

Date of Conference:

22-25 Sept. 2007