A stochastic optimization approach for robot scheduling

In this paper we are concerned with a stochastic optimization approach for determining the optimal job-sequencing in a robot-handler production system, such that the best value of some performance indices which depend on control parameters are obtained. The idea is to reflect the possible control policies of the system in its Stochastic Petri Net model (SPN) and to select a suitable conflict resolution rule whenever the transitions representing the possible actions of the robot are enabled. This rule would depend on a vectorx ∈ ℝn of control parameters, and the problem results in finding the values of those parameters which would be in some sense optimal for the system.The objective function is defined as a linear combination of several performance indices that are estimated simultaneously.We propose a combined simulation and optimization approach aimed at solving the conflict situations arising in the system due to simultaneous requests of the robot from jobs in different queues; then we establish a stochastic optimization approach for deriving control policies that govern the flow in the SPN model.The theoretical optimization criteria are presented along with a case study.

[1]  Yu-Chi Ho,et al.  Performance evaluation and perturbation analysis of discrete event dynamic systems , 1987 .

[2]  Alexei A. Gaivoronski Interactive Program SQG-PC for Solving Stochastic Programming Problems on IBM PC/XT/AT Compatibles - User Guide , 1988 .

[3]  K. Marti,et al.  Optimal step sizes in semi-stochastic approximation procedures. I , 1990 .

[4]  Anna Sciomachen,et al.  A statistical generalized programming algorithm for stochastic optimization problems , 1995, Ann. Oper. Res..

[5]  Yuri Ermoliev,et al.  Numerical techniques for stochastic optimization , 1988 .

[6]  Michael Pinedo,et al.  Stochastic Shop Scheduling: A Survey , 1982 .

[7]  Roger J.-B. Wets,et al.  Stochastic Programming: Solution Techniques and Approximation Schemes , 1982, ISMP.

[8]  A. A. Gaivoronskii Approximation methods of solution of stochastic programming problems , 1982 .

[9]  Roger J.-B. Wets,et al.  Preprocessing in Stochastic Programming: The Case of Linear Programs , 1992, INFORMS J. Comput..

[10]  András Prékopa,et al.  Contributions to the theory of stochastic programming , 1973, Math. Program..

[11]  Julia L. Higle,et al.  Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse , 1991, Math. Oper. Res..

[12]  R. Wets,et al.  Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse , 1986 .

[13]  Peter Kall,et al.  Stochastic Linear Programming , 1975 .

[14]  F. Archetti,et al.  Development analysis and simulation of Petri net models: an application to AGV systems , 1989 .

[15]  Peter W. Glynn,et al.  Monte Carlo Optimization of Stochastic Systems: Two New Approaches. , 1986 .

[16]  Yuri Ermoliev,et al.  Stochastic programming, an introduction. Numerical techniques for stochastic optimization , 1988 .

[17]  R Y Rubinstein,et al.  The score function approach for sensitivity analysis of computer simulation models , 1986 .

[18]  J. Kiefer,et al.  Stochastic Estimation of the Maximum of a Regression Function , 1952 .

[19]  A. Sciomachen,et al.  Evaluation of dispatching rules in a robot handling system , 1989, IEEE 1989 International Conference on Systems Engineering.

[20]  Yuri M. Ermoliev,et al.  Stochastic quasigradient methods for optimization of discrete event systems , 1992, Ann. Oper. Res..

[21]  Anna Sciomachen,et al.  Sensitivity analysis and optimization of stochastic Petri nets , 1993, Discret. Event Dyn. Syst..

[22]  R. Suri,et al.  Perturbation analysis: the state of the art and research issues explained via the GI/G/1 queue , 1989, Proc. IEEE.

[23]  Jean Walrand,et al.  The c# rule revisited , 1985 .

[24]  Manjunath Kamath,et al.  Applications of petri net based models in the modelling and analysis of flexible manufacturing systems , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[25]  J. Walrand,et al.  The cμ rule revisited , 1985, Advances in Applied Probability.

[26]  Andrzej Ruszczynski,et al.  A regularized decomposition method for minimizing a sum of polyhedral functions , 1986, Math. Program..

[27]  Rajan Suri,et al.  Finite-time behavior of two simulation optimization algorithms , 1990, 1990 Winter Simulation Conference Proceedings.