Optimal material release times in stochastic production environments

International Journal of Production Research

Volumn 37, Issue 6, 1999, Pages 1201-1216

  Hasan, C N ^a   Spearman, M L ^b  

^a Georgia Institute of Technology ^*  (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; LIFE CYCLE; OPTIMIZATION; PERTURBATION TECHNIQUES; PROCESS CONTROL; RANDOM PROCESSES; SCHEDULING;

MAKE-TO-ORDER ENVIRONMENT; TRANSIENT STATE SIMULATIONS;

JUST IN TIME PRODUCTION;

EID: 0032650511     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499191210     Document Type: Article

References (16)

1. Blum, J. R., 1954a, Approximation methods which converge with probability one. Annals of Mathematical Statistics, 25, 382-386.
2. Blum, J. R., 1954b, Multidimensional stochastic approximation methods. Annals of Mathematical Statistics, 25, 737-744.
3. Chong, E. K. P. and Ramadge, P. J., 1990, Convergence of recursive optimization algorithms using IPA derivative estimates. Proceedings of American Control Conference, Vol. 2, pp. 1022-1027.
4. Donohue, K. L. and Spearman, M. L., 1993, Improving the design of stochastic production lines: an approach using perturbation analysis. International Journal of Production Research, 31, 2789-2806.
5. Glasserman, P., 1991, Structural conditions for perturbation analysis derivative estimation: finite-time performance indices. Operations Research, 39, 724-738.
6. Hasan, C. N. and Spearman, M. L., 1995, Determining job completion times in stochastic production environments. Proceedings of the Winter Simulation Conference, edited by C. Alexopolous, K. Kang, W. R. Lilegdon and D. Goldsman, pp. 837-845
7. Ho, Y. C., Cao, X. and Cassandras, C., 1983, Infinitesimal and finite perturbation analysis for queueing networks. Automatica, 19, 439-445.
8. Ho, Y. C., and Cassandras, C., 1983, A new approach to the analysis of discrete event dynamic systems. Automatica, 19, 149-167.
9. Ho, Y. C., Eyler, Y. C. and Chien, T. T., 1979, A gradient technique for general buffer storage design in a production line. International Journal of Production Research, 17, 557.
10. Kesten, H., 1952, Accelerated stochastic approximation. Annals of Mathematical Statistics, 23, 463-467.
11. L’Ecuyer, P., Giroux, N. and Glynn, P. W., 1994, Stochastic optimization by simulation: numerical experiments with the M/M/1 queue in steady-state. Management Science, 40, 1245-1261.
12. Robbins, H. and Monro, S., 1951, A stochastic approximation method. Annals of Mathematical Statistics, 22, 400-407.
13. Rubinstein, R. Y., 1986, Monte Carlo Optimization, Simulation and Sensitivity of Queueing Networks (New York, Wiley).
14. Suri, R. and Leung, Y. T., 1989, Single run optimization of discrete event simulations -an empirical study using the M/M/1 queue. IIE Transactions, 21, 35-49.
15. Whitt, W., 1983, Queueing network analyzer. Bell Systems Technical Journal, 62, 2779-2815.
16. Woodruff, D. L. and Spearman, M. L., 1992, Sequencing and batching for two classes of jobs with deadlines and setup times. Production and Operations Management, 1, 87-102.