Available online 6 June 2009

We consider the problem of dynamically allocating production capacity between two products to minimize the average inventory and backorder costs per unit time in a make-to-stock single machine system. Using sample path comparisons and dynamic programming, we give a characterization of the optimal hedging point policy for a certain region of the state space. The characterization is simple enough...

Coordinated replenishment problems are common in manufacturing and distribution when a family of items shares a common production line, supplier, or a mode of transportation. In these situations the coordination of shared, and often limited, resources across items is economically attractive. This paper describes a mixed-integer programming formulation and Lagrangian relaxation solution procedur...

Operating rooms have become the most important areas in hospitals because of the scarcity and cost of resources. The present study investigates operating room scheduling and rescheduling considering the priority of surgical patients in a specialized hospital. The ultimate purpose of scheduling is to minimize patient waiting time, surgeon idle time between surgeries, and penalties for deviations...

The report describes the type of improved uninformed or heuristic search algorithms that are well-suited for non-procedural implementation in Control network programming, and how this can be achieved using the tools for dynamic computation control.

In this short paper we present a brief exposition of a composite decision process our unifying formulation of search procedures which provides new insights concerning the relationships among heuristic search, dynamic programming and branch and bound procedures.

We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced “anchor technique” is closely related to a tree-like set covering problem.

Overview material for the Special Session (Tuning Fuzzy Controllers Using Adaptive Critic Based Approximate Dynamic Programming) is provided. The Dual Heuristic Programming (DHP) method of Approximate Dynamic Programming is described and used to the design a fuzzy control system. DHP and related techniques have been developed in the neurocontrol context but can be equally productive when used w...

one major branch in mathematical sciences, which recently has been given especial attention, is optimization, including various methods such as linear programming, integer programming, and dynamic programming. due to the unique characteristics of air treatment systems, specifically multistage nature of such systems, dynamic programming has been widely applied. the purpose of this paper is to fi...

Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic programming algorithm is to decide on the set of tables that will hold optimal solutions to subproblems. This step predetermines the shape of the dynamic programming recurrences as well as the asymptotic efficiency of the alg...