Network flow modeling for flexible manufacturing systems with re-entrant lines

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2006, Pages 1043-1050

  Hindi, Haitham ^a   Ruml, Wheeler ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE TIME CONTROL SYSTEMS; FAILURE ANALYSIS; HEURISTIC METHODS; NUMERICAL METHODS; PROBLEM SOLVING; REDUNDANCY; RESOURCE ALLOCATION;

ADMISSIBLE HEURISTICS; ALBEIT CRUDES; REALISTIC INDUSTRIAL PROBLEM;

PROCESS PLANNING;

EID: 39649121084     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2006.377645     Document Type: Conference Paper

References (27)

1. P. Babtiste, C. Le Pape, and W Nuijten. Constraint-Based Scheduling. Kluwer, 2001.
2. 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.
3. D. Bertsimas and J. Tsitsiklis. Intro, to Linear Optimization. Athena Scientific, 1997.
4. S.P. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
5. Y. Crama, V. Kats, and J. van de Klundert. Cyclic scheduling in robotic flowshops. Ann. Oper. Res., (96):97-124, 2000.
6. J.G. Dai and G. Weiss. A fluid heuristic for minimizing makespan in job-shops. Operations Research, 50, 2002.
7. G.B. Dantzig. Linear Programming and Extensions. Princeton, 1963.
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. A. Dixit and V. Norman. Theory of International Trade. Cambridge University Press, 1980.
10. G. Finke. Practical network methods to solve TSP. In Int. Conf. on Optimization Techniques and Applications, Singapore, 1987.
11. 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.
12. M. Ghallab, D. Nau, and P. Traverso. Automated Planning. Morgan Kaufmann, 2004.
13. J.M. Harrison. Stochastic networks and activity analysis. In Y. Suhov, editor, Analytic Methods in Applied Probability. American Methematical Society, 2002.
14. K. Holmstrom, A. Goran, and M. Edval. TOMLAB/CPLEX Optimization Software for Matlab. TOMLAB Optimization, http://tomlab.biz, 2005.
15. 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.
16. L. Kantorovich. Mathematical methods in the organization and planning of production. Management Science, 6:366-422, 1960 (Russian original 1939).
17. F. Kelly. Reversibility and Stochastic Networks. Wiley, 1979.
18. 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.
19. C. Maglaras. Dynamic Control of Stochastic Processing Networks: A Fluid Model Approach. PhD thesis, EE Dept, Stanford University, 1998.
20. S.P. Meyn. Workload models for stochastic networks: Value functions and performance evaluation. IEEE Trans. Aut. Contr., 50(8): 1106-1122, 2005.
21. M.L. Pinedo. Scheduling Theory Algorithms and Systems. 2002, Prentice Hall.
22. M.L. Pinedo. Planning and Scheduling in Manufacturing and Services. 2005, Springer.
23. D. Ricardo. On The Principles of Political Economy and Taxation. John Murray, Albemarle-Street, London, 1817.
24. 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.
25. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 2002.
26. 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.
27. 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.