Liu, Ming; Chu, Chengbin; Xu, Yinfeng; Zheng, Feifeng - In: European Journal of Operational Research 201 (2010) 3, pp. 693-700
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...