In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST).We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SST is formulated as a two-stage stochastic programming problem. A procedure is proposed to effe...

Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...

A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...


 This paper considers multi-stage optimization problems under uncertainty that involve distinct offline and online phases. In particular it addresses the issue of integrating these phases to show how two are often interrelated in real-world applications. Our methods applicable (fairly general) conditions: 1) is exogenous; 2) possible define a greedy heuristic for phase can be modeled as p...

data envelopment analysis is a nonparametric technique checking efficiency of dmus using math programming. in conventional dea, it has been assumed that the status of each measure is clearly known as either input or output. kao and hwang (2008) developed a data envelopment analysis (dea) approach for measuring efficiency of decision processes which can be divided into two stages. the first stag...