Similar Search Results

An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times

Liu, Ming; Chu, Chengbin; Xu, Yinfeng; Zheng, Feifeng - In: Optimization letters 4 (2010) 2, pp. 227-237

Persistent link: https://www.econbiz.de/10003958316

An optimal online algorithm for single machine scheduling with bounded delivery times

Liu, Ming; Chu, Chengbin; Xu, Yinfeng; Zheng, Feifeng - In: European journal of operational research : EJOR 201 (2010) 3, pp. 693-700

Persistent link: https://www.econbiz.de/10003959758

An optimal online algorithm for single machine scheduling to minimize total general completion time

Liu, Ming; Chu, Chengbin; Xu, Yinfeng; Huo, Jiazhen - In: Journal of combinatorial optimization 23 (2012) 2, pp. 189-195

Persistent link: https://www.econbiz.de/10009507964

Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times

Liu, Ming; Chu, Chengbin; Xu, Yinfeng; Zheng, Feifeng - In: Journal of combinatorial optimization 21 (2011) 1, pp. 138-149

Persistent link: https://www.econbiz.de/10008855974

An optimal online algorithm for single machine scheduling with bounded delivery times

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...

Persistent link: https://www.econbiz.de/10008483314

A note on multiobjective second-order symmetric duality

Liu, Ming; Chu, Chengbin; Xu, Yinfeng; Zheng, Feifeng - In: European journal of operational research : EJOR 201 (2010) 2, pp. 649-652

Persistent link: https://www.econbiz.de/10008349230