We study the coordination of supply chains with a risk-neutral supplier and a risk-averse retailer. Different from the downside risk setting, in a conditional value-at-risk (CVaR) framework, we show that the supply chain can be coordinated with the revenue-sharing, buy-back, two-part tariff and...

This paper focuses on the performance analysis on a complex remanufacturing system that consists of a disassembling shop, a remanufacturing shop, an assembling shop, and a warehouse. The optimal remanufacturing policy is given. Furthermore, by the matrix-geometric method, the immediate demand...

We consider a two-stage serial inventory system whose cost structure exhibits economies of scale in both stages. In the system, stage 1 faces Poisson demand and replenishes its inventory from stage 2, and the latter stage in turn orders from an outside supplier with unlimited stock. Each...

A weighted embedding for the generalized pontogram {Kn(t): 0[less-than-or-equals, slant]t[less-than-or-equals, slant]1} corresponding pointwise to a renewal process {N(s): 0[less-than-or-equals, slant]s[infinity]} via Kn(t)=n-1/2(N(nt)-tN(n)) is studied in this paper. After proper normalization,...

A generalized pontogram {Kn(t): 0 [less-than-or-equals, slant] t [less-than-or-equals, slant] 1} corresponding pointwise to a renewal counting process {N(x): 0 [less-than-or-equals, slant] x [infinity]} via Kn(t) = n-1/2(N(nt)-tN(n)) is investigated in this paper. A weighted embedding for the...

We consider single-item (r, q) and (s, T) inventory systems with integer-valued demand processes. While most of the inventory literature studies continuous approximations of these models and establishes joint convexity properties of the policy parameters in the continuous space, we show that...

We present a novel semi-parametric model for two-sample survival data, and an estimation method with a simple, closed-form solution. We study analytically the asymptotics of the estimators, and conduct a small simulation study.

The minimum spillage sequencing problem, which arises in real-time satellite signal data processing, requires a set of numbers to be arranged so as to minimize the "overflow" of the partial sums above an upper bound. We subject several heuristics to worst-case analysis, average-case analysis,...

We consider the problem of minimizing the expected makespan of n jobs with independent exponentially distributed processing times on two parallel machines, under resource constraints. Job j has expected processing time 1/\mu _j and requires throughout its processing an amount r_j of a resource; the...