We consider a stochastic scheduling problem which generalizes traditional stochastic scheduling by introducing parameter uncertainty. Two classes of independent jobs have to be processed by a single machine so as to minimize the sum of expected completion times. The processing times of the jobs...

We consider a stochastic scheduling problem in which there is uncertainty about parame-ters of the probability distribution of the processing times. We restrict ourselves to the setting in which there are two different classes of jobs. The processing times of the jobs are assumed to be...

We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as...

It is well known that competitive analysis yields results that do not reflect the observed performance of online paging algorithms. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the well-performing...

In the last 20 years competitive analysis has become the main tool for analyzing the quality of online algorithms. Despite of this, competitive analysis has also been criticized: it sometimes cannot discriminate between algorithms that exhibit significantly different empirical behavior or it...

We study a dynamic pricing problem for a company that sells a single product to a group of customers over a finite time horizon. These customers are price sensitive and the price of today influences the group of customers of tomorrow. The objective is to set the prices over time so as to...

This article builds on the call of various authors (e.g. George & Jones, 2000; Mitchell & James,2001; Rousseau & Fried, 2001) for a better representation of time in theory-building andresearch in organizational behavior (OB). It proposes a radical temporalist approach to the study of OB which combines a...

Under a k-approval scoring rule each agent attaches a score of one to his k most preferred alternatives and zero to the other alternatives. The rule assigns the set of alternatives with maximal score. Agents may extend preferences to sets in several ways: they may compare the worst alternatives,...

Competition in the emerging multimedia market currently focuses on setting standards for storing, retrieving, processing, (de)compressing, and transmitting information. Each multimedia system or architecture combines several standards, some proprietary. This paper uses selected insights from...

This paper investigates exceptional phases of stock market cycles. Defined in Pagan and Sossounov (2003) as unusual, they are detected as outliers in the historical distribution. Moreover, this study completes the growing literature on stock market bulls and bears in several aspects. First,it...