Traditionally, project scheduling and material planning have been treated independently. In this research, a mixed integer programming model is presented to integrate project scheduling and materials ordering problems. The goal is to minimize the total material holding and ordering costs. In addition, an efficient metaheuristic algorithm is proposed to solve the model. The proposed algorithm is...

achieving optimal production cycle time for improving manufacturing processes is one of the common problems in production planning. during recent years, different approaches have been developed for solving this problem, but most of them assume that mean quality characteristic is constant over production run length and sets it on customer’s target value. however, the process mean may drift from ...

This section is devoted to the Economic Production Quantity (EPQ) model, its specialization to the Economic Order Quantity (EOQ) model and its extension to allow backorders. The next section deals with multiple products. The primary driver to hold inventories is the presence of a fixed production/ordering cost that is incurred every time a positive number of units are produced/ordered. We wish ...

Introduction. We study a class of capacitated stochastic lot-sizing inventory control problems with stochastic, non-stationary and correlated demands that evolve over time. Economies of scale and capacity constraints exist in many practical scenarios. However, models with fixed ordering costs and capacity constraints are typically computationally intractable, and even the structure of the optim...

Interdependence of minor ordering costs occurs in joint replenishment of inventory when the cost of placing an item in an order depends on which other items are also in the order. In this paper, we propose an evolutionary algorithm (EA) for joint replenishment of inventory which allows for the interdependence of minor ordering costs. Since solutions to the joint replenishment problem (JRP) can ...

This paper studies stochastic inventory problems with unbounded Markovian demands, ordering costs that are lower semicontinuous, and inventory/backlog (or surplus) costs that are lower semicontinuous with polynomial growth. Finite horizon problems, stationary and nonstationary discounted cost in nite horizon problems, and stationary long-run average cost problems are addressed. Existence of opt...

Suppose that infinitesimal firms have identical variable costs but there is heterogeneity in their fixed costs. Regardless of the ordering of entry and exit, fixed costs will be minimized for a given industry size. Journal of Economic Literature Classifications: L11 & L13

This paper describes a learning system, LASSY1, which explores domains represented by Prolog databases, and use its acquired knowledge to increase the efficiency of a Prolog interpreter by reordering subgoals. The system creates a model of the tasks it faces and uses the model to generate informative training tasks. While performing the training tasks the system updates its inductive knowledge ...

— This paper considers optimum ordering policies minimizing the expected cost per unit time in the steady-state. It is assumed that a lead time for the spare is constant and order costs depend on time. It is shown in theorem that there exists afinite and unique optimum ordering policy under certain conditions.