| 1. |
- Ding, Xiao-song, et al.
(författare)
-
A joint pricing and inventory control problem under an energy buy-back program
- 2012
-
Ingår i: Operations Research Letters. - : Elsevier BV. - 0167-6377 .- 1872-7468. ; 40:6, s. 516-520
-
Tidskriftsartikel (refereegranskat)abstract
- The demand for power keeps rising with rapid economic development and growth of industrialization. The frequent mismatch created between demand and supply can be mitigated by the use of energy buyback programs. This paper models a buy-back program using a periodic review joint pricing and inventory model, incorporating compensations and setup cost over finite planning horizons. It is shown that an (s, S, A, P∗) policy is optimal for the decision maker for maximizing the expected total profit.
|
|
| 2. |
- Fogelklou, Oswald, et al.
(författare)
-
On the global stability of a peer-to-peer network model
- 2012
-
Ingår i: Operations Research Letters. - : Elsevier BV. - 0167-6377 .- 1872-7468. ; 40:3, s. 190-194
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we analyze the stability properties of a system of ordinary differential equations describing the thermodynamic limit of a microscopic and stochastic model for file sharing in a peer-to-peer network introduced by Kesidis et al. We show, under certain assumptions, that this BitTorrent-like system has a unique locally attracting equilibrium point which is also computed explicitly. Local and global stability are also shown.
|
|
| 3. |
- Mastrolilli, Monaldo, et al.
(författare)
-
Minimizing the sum of weighted completion times in a concurrent open shop
- 2010
-
Ingår i: Operations Research Letters. - : Elsevier BV. - 0167-6377 .- 1872-7468. ; 38:5, s. 390-395
-
Tidskriftsartikel (refereegranskat)abstract
- We study minimizing the sum of weighted completion times in a concurrent open shop. We give a primal-dual 2-approximation algorithm for this problem. We also show that several natural linear programming relaxations for this problem have an integrality gap of 2. Finally, we show that this problem is inapproximable within a factor strictly less than 6/5 if not equal NP, or strictly less than 4/3 if the Unique Games Conjecture also holds. (C) 2010 Elsevier B.V. All rights reserved.
|
|
| 4. |
- Pavon-Marino, P., et al.
(författare)
-
On total traffic domination in non-complete graphs
- 2011
-
Ingår i: Operations Research Letters. - : Elsevier BV. - 0167-6377. ; 39, s. 40-43
-
Tidskriftsartikel (refereegranskat)abstract
- Abstract in Undetermined Given an undirected graph g(V, E), a set of traffic matrices H and one additional traffic matrix h, we say that H totally dominates h if, for each capacity reservation u supporting H, u also supports h using the same routing pattern. It has been shown that if vertical bar H vertical bar = 1 = (H = {(h) over cap}, say) and g, is a complete graph, H totally dominates h if, and only if, (h) over cap >= h component-wise. In this paper we give a generalized condition for vertical bar H vertical bar >= 1 and any undirected graph.
|
|
