IMADA - Department of Mathematics and Computer Science |

**Optimal Preemptive Semi-Online Scheduling to Minimize Makespan on Two Related Machines***Leah Epstein, Lene M. Favrholdt* Operations Research Letters, 30(4): 269-275, 2002
We study a preemptive semi-online scheduling problem. Jobs with
non-increasing weights arrive one by one to be scheduled on two uniformly
related machines. We analyze the algorithms as a function of the speed
ratio ( The publication is available from ScienceDirect (subscription may be required). |

IMADA HOME | SDU HOME | Previous page Last modified: 2017-06-10 by Lene Monrad Favrholdt <lenem@imada.sdu.dk> |