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

Optimal routing and scheduling in flexible manufacturing systems using integer programming

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)
Cogill, R. ; Virginia Univ., Charlottesville ; Hindi, H.

Here we consider the problem of maximum throughput routing and scheduling for flexible manufacturing systems/cells (FMS/FMC) and processing networks. Such a system consists of a set of machines which process materials and a transport network for moving materials among the machines. The goal in this problem is to find a policy for introducing jobs into the network and routing jobs through the network that maximizes the average number of jobs entering the system per unit time. We present an 0-1 linear program formulation of the maximum throughput routing and scheduling problem. This formulation is based on an extension of the linear programming formulation of the multistage network flow problem. For small problem instances, existing 0-1 solvers can be used to find an optimal schedule. For larger problem instances, we discuss the use of linear programming relaxations to find performance guarantees and rounding techniques for extracting feasible 0-1 solutions from the linear program solution. Finally, we demonstrate the general techniques described in the paper on a large-scale example. For this example, solving the linear programming relaxation and extracting a feasible schedule produces an optimal solution.

Published in:

Decision and Control, 2007 46th IEEE Conference on

Date of Conference:

12-14 Dec. 2007

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.