We consider component allocation in Assemble-to-Order production–inventory systems. We prove that asymptotic optimality on the diffusion scale can be achieved under a continuous-review policy. We also show that in many systems, meeting this optimality criterion requires component reservation.

A multi-class M/M/1 system, with service rate μin for class-i customers, is considered with the risk-sensitive cost criterion n−1 logE exp ∑ i ciXi(T ), where ci > 0, T > 0 are constants, Xi(t) denotes the class-i queue-length at time t assuming the system starts empty. It is shown that, as n → ∞, asymptotic optimality is achieved by the service policy that prioritizes the classes in decreasing...

A nonlinear mathematical model which includes synergistic effects of chemo- and immunotherapy is analyzed (both analytically numerically) as an optimal control problem with free terminal time for the scheduling combination therapies. Side drugs are measured indirectly by including total doses respective weights penalty terms in objective. The formulation allows us to judge amounts agents requir...

In “A Restless Bandit Model for Resource Allocation, Competition and Reservation,” J. Fu, B. Moran, P. G. Taylor study a resource allocation problem with varying requests resources of limited capacity shared by multiple requests. This is modeled as set heterogeneous restless multi-armed bandit problems (RMABPs) connected constraints imposed capacity. Following Whittle’s idea relaxing the Weber ...

The well-known and established global optimality conditions based on the Lagrangian formulation of an optimization problem are consistent if and only if the duality gap is zero. We develop a set of global optimality conditions which are structurally similar but which are consistent for any size of the duality gap. This system characterizes a primal–dual optimal solution by means of primal and d...

in this paper we study optimization problems with infinite many inequality constraints on a banach space where the objective function and the binding constraints are locally lipschitz‎. ‎necessary optimality conditions and regularity conditions are given‎. ‎our approach are based on the michel-penot subdifferential.

S-shaped incentive schemes and pay caps are fairly common in practice. This paper demonstrates the optimality of s-shaped incentive schemes and pay caps by incorporating salespeople’s aversion to pay inequity into the standard agency model. Our analysis shows that salespeople’s desire for pay fairness increases the convexity of the optimal incentive scheme at small sales but increases the conca...

Planning as satisfiability, represented by SATPlan, can find plans with the shortest makespan for classical planning. However, it has been deemed a limitation of SAT-based approaches for delivering optimality regarding metrics other than the makespan. Our Plan-A solver uses the SAT-based framework to find plans with minimal total action costs. The idea is to optimally solve SAT instances based ...

this paper provides an analysis of persian verbs within the framework of optimality theory. to be more specific, it mainly cocentrates on past and present stems of persian verbs. since analyzing this subject within the derivational framework would result phonological rules which are not natural, it is analysed by optimality theory which is one of the constraint-based approach. based on this, we...