We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...

air defense is a crucial area for all naval combat systems. in this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. we define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. the optimal scheduling of the weapon results in an in...

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...

This paper investigates the Stackelberg equilibrium for pricing and ordering decisions in a dominant retailer dual-channel supply chain. In a dual-channel sales network, the products are sold through both a traditional, physical retailer and a direct Internet channel. It is assumed that the retailer is the leader and the powerful member of the supply chain has the market power and acts as a lea...

The multi-level programming problem is defined as an n-person nonzero-sum game with perfect information in which the players move sequentially. The bi-level linear case is addressed in detail. Solutions are obtained by recasting this problem as a standard mathematical probram and appealing to its implicitly separable structure. The reformulated optimization problem is linear save for a ~ompleme...

This paper considers the following basic problem in scheduling under uncertainty: given an activity-on-node network where each activity has an uncertain duration represented by an interval, compute the minimum float of each activity over all duration scenarios. For solving this NP-hard problem, Dubois et al. [5] and Fortin et al. [7] have recently proposed an algorithm based on path enumeration...