Consider a set N of n(> 1) stores with single-item and single-period nondeterministic demands like in a classic newsvendor setting with holding and penalty costs only. Assume a risk-pooling single-warehouse centralized inventory ordering option. Allocation of costs in the centralized inventory ordering corresponds to modelling it as a cooperative cost game whose players are the stores. It has b...

‎a common approach to determine efficient solutions of a multiple objective optimization problem‎ ‎is reformulating it to a parameter dependent scalar optimization problem‎. ‎this reformulation is called scalarization approach‎. here, a well-known scalarization approach named pascoletti-serafini scalarization is considered‎. first, some difficulties of this scalarization are discussed and then ...

Let G be a complete, weighted, undirected, bipartite graph with n red nodes, n0 blue nodes, and symmetric cost function c(x; y). A maximum matching for G consists of minfn; n0g edges from distinct red nodes to distinct blue nodes. Our objective is to nd a minimumcost maximum matching, i.e., one for which the sum of the edge costs has minimal value. This is the weighted bipartite matching proble...

Let G be a complete, weighted, undirected, bipartite graph with n red nodes, n blue nodes, and symmetric cost function c(x, y). A maximum matching for G consists of min{n, n′} edges from distinct red nodes to distinct blue nodes. Our objective is to find a minimumcost maximum matching, i.e., one for which the sum of the edge costs has minimal value. This is the weighted bipartite matching probl...

‎A common approach to determine efficient solutions of a multiple objective optimization problem‎ ‎is reformulating it to a parameter dependent scalar optimization problem‎. ‎This reformulation is called scalarization approach‎. Here, a well-known scalarization approach named Pascoletti-Serafini scalarization is considered‎. First, some difficulties of this scalarization are discussed and then ...

The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotiv...

This paper proposes the optimal policies for a fuzzy inventory model considering holding cost and ordering as continuous functions of time. Shortages are allowed partially backlogged. The demand rate is assumed in such to be linearly dependent on time during on-hand inventory, while shortage period, it remains constant. problem formulated crisp environment. Considering rate, trapezoidal numbers...

Mathematical models have been used in many areas of supply chain management. In this paper, we present a mixed-integer non-linear programing (MINLP) model to solve a multi-period, closed-loop supply chains (CLSCs) with two echelons consist of producers and customers. In order to satisfy the demands, the producers are be able to order for materials in the beginning of each period for one or more...