In the past, researchers presented a linear programming formulation for the economic sizing of warehouses when demand is highly seasonal and public warehouse space is available on a monthly basis. The static model was extended for the dynamic sizing problem in which the warehouse size is allowed...

In media planning, the media planner has to decide on the optimal number of insertions to be made in various media vehicles so as to maximize some measure of effectiveness. The parameters such as Reach, Gross Opportunities-To-See, Average Opportunities-To-See, Cost Per Person Reached etc. have...

In the past, researchers presented a linear programming formulation for the economic sizing of warehouses when demand is highly seasonal and public warehouse space is available on a monthly basis. The static model was extended for the dynamic sizing problem in which the warehouse size is allowed...

Usually, the process of selection of personnel consists of various components and the scores obtained by each individual on these components are weighted to arrive at a composite score. Very often, these weights are determined subjectively. The individuals are ranked on the basis of this...

Determining the optimal size for a private warehouse is a planning problem which can affect the overall operations of a firm. Some Authors presented a linear programming formulation which determines the optimal size warehouse to construct when demand is highly seasonal and public warehouse space...

A modified formulation of the multi-item lot sizing problem with joint replenishments is discussed. The new formulation results in the reduction in the number of constraints and consequently possible reduction in the computational effort.The formulation is extended to the case when there is an...

Researchers in the past dealt with the optimization problem relating to deterministic opportunistic replacement problem. Complete solutions were obtained for a two component situation for both finite and infinite time horizon. For the multicomponent opportunistic replacements with fixed time...

The problem of generating a cinema schedule for advertisement to maximize gross OTS ( Opportunities-To-See ) attracted the attention of media plan researchers. The development of a cinema schedule so that desired Reach is achieved in each town and the total cost of advertisement does not exceed...

Researchers in the past dealt with the optimization problem relating to deterministic opportunistic replacement problem. Complete solutions were obtained for a two component situation for both finite and infinite time horizon. For the multi-component opportunistic replacements with fixed time...

The Vehicle Routing Problem (VRP) is concerned with finding efficient routes for a fleet of vehicles/buses to pick up employees from pre-determined bus stops and bring them to the work place. We believe that the VRP will increase in importance as the fuel prices rise and as the extent to which...