We study an online scheduling problem on a single machine with delivery times. The problem is online in the sense that all jobs arrive over time. Each job's characteristics, such as processing time and delivery time, become known at its arrival time. Preemption is not allowed and once the...

This work studies a variant of the online generalized assignment problem, where there are m⩾2 heterogeneous servers to process n requests which arrive one by one over time. Each request must either be assigned to one of the servers or be rejected upon its arrival, before knowing any...

Batch processing machine scheduling in uncertain environment attracts more and more attention in the last decade. This paper deals with semi-online scheduling on two parallel batch processing machines with non-decreasing processing time of job. Jobs arrive over time in the online paradigm, and...

In this note, we study parallel machine scheduling problem with past-sequence-dependent delivery times and a deterioration effect. We present polynomial algorithms for the problem with the total workload, the total completion time, the total absolute differences in completion times objectives.

This paper uses dynamic impulse response analysis to investigate the interrelationships among stock price volatility, trading volume, and the leverage effect. Dynamic impulse response analysis is a technique for analyzing the multistep ahead characteristics of a non-parametric estimate of the...

Because they are scaled by price, the ability of size (i.e., the market capitalization of a firm), and the book-to-market equity ratio to determine expected returns may, according to Berk (1995), reflect only a simultaneity bias. The two-stage least squares approach is used to control for this...