Optimal routing and scheduling in flexible manufacturing systems using integer programming

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2007, Pages 4095-4102

  Cogill, Randy ^a   Hindi, Haitham ^b  

^a University of Virginia

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; JOB ANALYSIS; LINEAR PROGRAMMING; NETWORK ROUTING; SCHEDULING;

LINEAR PROGRAMMING FORMULATION; LINEAR PROGRAMMING RELAXATION; MULTISTAGE NETWORK FLOW PROBLEM; OPTIMAL ROUTING;

MANUFACTURE;

EID: 62749116481     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2007.4434884     Document Type: Conference Paper

References (26)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows. Prentice Hall, 1993.
2. P. Babtiste, C. Le Pape, and W. Nuijten. Constraint-Based Scheduling. Kluwer, 2001.
3. D. Bertsemas, D. Gamarnik, and J. Sethuraman. From fluid relaxations to practical algorithms for job shop scheduling: the holding cost objective. Operations Research, 51, 2003.
4. S.P. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
5. R. Cogill and H. Hindi. Discrete dynamic network flow modeling for flexible manufacturing systems with re-entrant lines using integer programming. Technical report, Palo Alto Research Center (PARC), 2006.
6. Y. Crama, V. Kats, and J. van de Klundert. Cyclic scheduling in robotic flowshops. Ann. Oper. Res., (96):97-124, 2000.
7. J.G. Dai and G. Weiss. A fluid heuristic for minimizing makespan in job-shops. Operations Research, 50, 2002.
8. M.W Dewande, H.N. Geismar, and S.P. Sethi. Dominance of cyclic solutions and challenges in the scheduling of robotic cells. SIAM Review, 47(4):709-721, 2005.
9. M.P.J. Fromherz, D.G. Bobrow, and J. de Kleer. Model-based computing for design and control of reconfigurable systems. AI Magazine, Special Issue on Qualitative Reasoning, 24, 2003.
10. M. Ghallab, D. Nau, and P. Traverso. Automated Planning. Morgan Kaufmann, 2004.
11. J.M. Harrison. Stochastic networks and activity analysis. In Y. Suhov, editor, Analytic Methods in Applied Probability. American Methematical Society, 2002.
12. H. Hindi and W. Ruml. Network flow modeling for flexible manufacturing systems with re-entrant lines. In IEEE Conf. on Dec. & Contr., December 2006.
13. K. Holmstrom, A. Goran, and M. Edvall. TOMLAB/CPLEX Optimization Software for Matlab. TOMLAB Optimization, http://tomopt.com, 2005.
14. M. Johansson, L. Xiao, and S. Boyd. Optimal routing and sinr target selection for power-controlled cdma wireless networks. In Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt), 2003.
15. F. Kelly. Reversibility and Stochastic Networks. Wiley, 1979.
16. P.R. Kumar and S.P. Meyn. Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies. IEEE Trans. Aut. Contr., 41:4-17, 1996.
17. C. Maglaras. Dynamic Control of Stochastic Processing Networks: A Fluid Model Approach. PhD thesis, EE Dept, Stanford University, 1998.
18. S.P. Meyn. Workload models for stochastic networks: Value functions and performance evaluation. IEEE Trans. Aut. Contr., 50(8):1106-1122, 2005.
19. M.L. Pinedo. Scheduling Theory Algorithms and Systems. 2002, Prentice Hall.
20. M.L. Pinedo. Planning and Scheduling in Manufacturing and Services. 2005, Springer.
21. W. Ruml, M.B. Do, and M.P.J. Fromherz. On-line planning and scheduling in a high-speed manufacturing domain. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS-05), 2005.
22. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 2002.
23. M.H.L. van den Briel, T. Vossen, and S. Kambhampati. Reviving integer programming approaches for ai planning: A branch-and-cut framework. In International Conference on Automated Planning and Scheduling (ICAPS), 2005.
24. T-.Y. Wang and Y-.L. Chen. Applying the network flow model to evaluate an FMCs throughput. Int. J. Prod. Res., 40(3):525-536, 2002.
25. L. Wolsey. Integer Programming. Wiley Interscience, 1998.
26. L. Xiao, M. Johansson, and S. Boyd. Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. on Comm., 52(7):1136-1144, July 2004.