Optimization models of discrete-event system dynamics

Operations Research

Volumn 56, Issue 5, 2008, Pages 1218-1237

  Chan, Wai Kin ^a   Schruben, Lee ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT GENERATIONS; DISCRETE EVENTS; DISCRETE-EVENT SYSTEMS; GRADIENT ESTIMATIONS; MANUFACTURING SYSTEMS; MATHEMATICAL THEORIES; MAX-PLUS ALGEBRAS; MIXED-INTEGER PROGRAMS; OPTIMIZATION MODELS; OPTIMIZATION PROBLEMS; POTENTIAL APPLICATIONS; QUEUEING SYSTEMS; RELATIONSHIP GRAPHS; RESOURCE-SCHEDULING; VIRTUAL RESOURCES;

ALGEBRA; CONSTRAINED OPTIMIZATION; DYNAMICS; INDUSTRIAL APPLICATIONS; OPTIMIZATION; QUEUEING NETWORKS; QUEUEING THEORY;

INTEGER PROGRAMMING;

EID: 60749115278     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0559     Document Type: Article

References (57)

1. Askin, R. G., C. R. Standridge. 1993. Modeling and Analysis of Manufacturing Systems. Wiley, New York.
2. Baccelli, F., P. Bremaud. 2003. Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences. Springer Verlag, New York.
3. Baccelli, F., G. Cohen, G. J. Olsder, J. P. Quadrat. 1992. Synchronization and Linearity: An Algebra for Discrete-Event Systems. Wiley, New York.
4. Buss, A. H., P. J. Sanchez. 2002. Building complex models with LEGOs (listener event graph objects). Proc. 2002 Winter Simulation Conf., Cat. 02CH37393, Vol. 1. IEEE, San. Diego, 732-737.
5. Buzacott, J. A., J. G. Shanthikumar. 1993. Stochastic Models of Manufacturing Systems. Prentice Hall, Englewood Cliffs, NJ.
6. Cao, X. R. 1985. Convergence of parameter sensitivity estimates in a stochastic experiment. IEEE Trans. Automatic Control 30(9) 845-853.
7. Chan, W. K. V. 2005. Mathematical representations of discrete-event system dynamics. Ph.D. dissertation, University of California, Berkeley.
8. Chan, W. K. V., L. W. Schruben. 2003. Properties of discrete-event systems from their mathematical programming representations. Proc. 2003 Winter Simulation Conf., Cat. 03CH7499, Vol. 1. IEEE, Piscataway, NJ, 496-502.
9. Chan, W. K. V., L. W. Schruben. 2004. Generating scheduling constraints for discrete event dynamic systems. Proc. 2004 Winter Simulation Conf., Cat. 04CH37614C, Vol. 2. IEEE, Piscataway, NJ, 568-576.
10. Cheng, D. W. 1995. Line reversibility of tandem queues with general blocking. Management Sci. 41(5) 864-873.
11. Cheng, D. W. 1997. Line reversibility of multiserver systems. Probab. Engrg. Informational Sci. 11 177-188.
12. Cheng, D. W., D. D. Yao. 1993. Tandem queues with general blocking: A unified model and comparison results. Discrete Event Dynamic Systems 2(3-4) 207-234.
13. Cohen, G., S. Gaubert, J. P. Quadrat. 1999. Max-plus algebra and system theory: Where we are and where to go now. Annual Rev. Control 23 207-219.
14. Dallery, Y., L. Zhen, D. Townsley. 1994. Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking. J. ACM 41(5) 903-942.
15. Dattatreya, E. S. 1978. Tandem queueing systems with blocking. Ph.D. dissertation, University of California, Berkeley.
16. Dawande, M., C. Sriskandarajah, S. Sethi. 2002. On throughput maximization in constant travel-time robotic cells. Manufacturing Service Oper. Management 4(4) 296-312.
17. Dawande, M., H. N. Geismar, S. P. Sethi, C. Sriskandarajah. 2005. Sequencing and scheduling in robotic cells: Recent developments. J. Scheduling 8(5) 387-426.
18. Ding, S., J. Yi. 2004. An event relationship graph based simulation and analysis of multi-cluster tools. Proc. 2004 Winter Simulation Conf., Cat. 04CH37614C, Vol. 2. IEEE, Piscataway, NJ, 1915-1924.
19. Freimer, M., L. Schruben. 2001. Graphical representation of IPA estimation. Proc. 2001 Winter Simulation Conf., Cat. 01CH37304, Vol. 1. IEEE, Piscataway, NJ, 422-427.
20. Fu, M., J. Q. Hu. 1997. Conditional Monte Canlo: Gradient Estimation and Optimization Applications. Kluwer Academic Publishers, Boston.
21. Gal, T. 1979. Postoptimal Analyses, Parametric Programming and Related Topics. McGraw-Hill, London.
22. Glasserman, P. 1991. Gradient Estimation via Perturbation Analysis. Kluwer Academic Publishers, Boston.
23. Gondran, M., M. Minoux. 1984. Linear algebra in dioids: A survey of recent results. Ann. Discrete Math. 19 147-164.
24. Ho, Y. C., X. Cao. 1991. Perturbation Analysis of Discrete-Event Dynamic Systems. Kluwer Academic Publishers, Boston.
25. Ho, Y. C., M. A. Eyler, T. T. Chien. 1979. A gradient technique for general buffer storage design in a production line. Internat. J. Production Res. 17(6) 557-580.
26. Homem-de-Mello, T., A. Shapiro, M. L. Spearman. 1999. Finding optimal material release times using simulation-based optimization. Management Sci. 45(1) 86-102.
27. Hooker, J. N. 2002. Logic, optimization, and constraint programming. INFORMS J. Comput. 14(4) 295-321.
28. Hyden, P., L. Schruben, T. Reeder. 2001. Resource graphs for modeling large-scale, highly congested systems. Proc. 2001 Winter Simulation Conf., Cat. 01CH37304, Vol. 1. IEEE, Piscataway, NJ, 523-529.
29. Kim, S. 2006. Gradient-based simulation optimization. Proc. 2006 Winter-Simulation Conf., IEEE, Piscataway, NJ, 159-167. Cat. 06CH37826, Vol. 1.
30. Law, A., W. D. Kelton. 2000. Simulation Modeling and Analysis. McGraw-Hill, Boston.
31. Liberopoulos, G., Y. Dallery. 2000. A unified framework for pull control mechanisms in multi-stage manufacturing systems. Ann. Oper: Res. 93 325-355.
32. Lindley, D. V. 1952. The theory of queues with a single server. Proc. Cambridge Philos. Soc. 48(2) 277-289.
33. Maxwell, W. L., R. C. Wilson. 1981. Dynamic network flow modeling of fixed path material handling systems. HE Trans. 13(1) 12-21.
34. Muth, E. J. 1979. The reversibility property of production lines. Management Sci. 25(2) 152-158.
35. Nehme, D. A., N. G. Pierce. 1994. Evaluating the throughput of cluster tools using event-graph simulations. IEEE/SEMI 1994 Advanced Semiconductor Manufacturing Conf. and Workshop. Theme-Manufacturing Excellence: A Global Challenge. ASMC '94 Proc, Cat. 94CH3475-1. IEEE, New York, 189-192.
36. Nemhauser, G. L., L. A. Wolsey. 1999. Integer and Combinatorial Optimization. Wiley, New York.
37. Onvural, R. O. 1990. Closed queueing networks with blocking. H. Takagi, ed. Stochastic Analysis of Computer and Communication Systems. North-Holland, Amsterdam, 499-528.
38. Pegden, C. D. 1982. Introduction to SIMAN. Systems Modeling Corporation, Pennsylvania.
39. Perkinson, T. L., P. K. McLarty, R. S. Gyurcsik, R. K. Cavin III. 1994. Single-wafer cluster tool performance: An analysis of throughput. IEEE Trans. Semiconductor Manufacturing 7(3) 369-373.
40. Pinedo, M. 2002. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, Upper Saddle River, NJ.
41. Rostami, S., B. Hamidzadeh. 2002. Optimal scheduling techniques for cluster tools with process-module and transport-module residency constraints. IEEE Trans. Semiconductor Manufacturing 15(3) 341-349.
42. Savage, E. L., L. W. Schruben, E. Yucesan. 2005. On the generality of event relationship graph models. INFORMS J. Comput. 17(1) 3-9.
43. Schruben, D., L. W. Schruben. 2000. Graphical Simulation Modeling Using SIGMA. Custom Simulation, Ithaca, New York.
44. Schruben, L. W. 1983. Simulation modeling with event relationship graphs. Comm. ACM 26(11) 957-963.
45. Schruben, L. W. 2000. Mathematical programming models of discrete event system dynamics. Proc. 2000 Winter Simulation Conf., Cat. 00CH37165, Vol. 1. IEEE, Piscataway, NJ, 381-385.
46. Schruben, L. W., T. M. Roeder. 2003. Fast simulations of large-scale highly congested systems. Simulation, Trans. Soc. Modeling and Simulation Internat. 79(3) 115-125.
47. Schruben, L. W., E. Yucesan. 1994. Transforming Petri nets into event graph models. Proc. 1994 Winter Simulation Conf., Cat. 94CH35705. IEEE, New York, 560-565.
48. Seila, A. F., V. Ceric, P. Tadikamalla. 2003. Applied Simulation Modeling. Thomson-Brooks/Cole, Belmont, CA.
49. Shapiro, G. W., H. L. W. Nuttle. 1988. Hoist scheduling for a PCB electroplating facility. IEE Trans. 20(2) 157-167.
50. Som, T. K., R. G. Sargent. 1990. A formal development of event relationship graphs as an aid to structured and efficient simulation programs. ORSA J. Comput. 1(2) 107-125.
51. Suri, R. 1987. Infinitesimal perturbation analysis for general discrete-event systems. J. ACM 34(3) 686-717.
52. Suri, R., M. A. Zazanis. 1988. Perturbation analysis gives strongly consistent sensitivity estimates for the M/G/l queue. Management Sci. 34(1) 39-64.
53. Williams, H. P. 1995. Logic applied to integer programming and integer programming applied to logic. Eur. J. Oper: Res. 81(3) 605-616.
54. Wu, J. H., C. N. Chung. 1991. Timed finite automata as the theoretical foundation for simulation modeling with event relationship graphs. Technical report, Department of Decision Science and Information Systems, University of Kentucky, Lexington.
55. Yamazaki, G., H. Sakasegawa, T. Kawashima. 1978. Production rate estimated with flow-shop reversibility. Bull. Japan Soc. Mechanical Engineers 21 167-171.
56. Yucesan, E., L. Schruben. 1992. Structural and behavioral equivalence of simulation models. ACM Trans. Modeling Comput. Simulation 2(1) 82-103.
57. Zeigler, B. P. A. 1984. Theory of Modelling and Simulation. Krieger Publishing Company, Melbourne, Australia.