Design of serial production systems using discrete event simulation and nonconvex programming techniques

Efficient techniques for discrete event simulation and sensitivity analysis of production systems are used to accelerate the solution of nonconvex optimization problems which are quite often encountered in practice. The design algorithm is of the branch and bound type and solves a sequence of convex problems resulting from successive partitions of the feasible set. Examples are given, and computational considerations are discussed.