论文信息 - Online Machine Scheduling with Family Setups

Online Machine Scheduling with Family Setups

We consider the problem of online scheduling a single machine with family setups under job availability. A setup must be scheduled when the next job comes from a different family from the last completed one, if any. The aim is to minimize the total completion time of all jobs. For the special case of identical processing times, we provide a lower bound for the competitive ratio and an online algorithm with its competitive analysis.

Lele Zhang | Andrew Wirth

[1] Michael E. Saks,et al. Approximation algorithms for problems in scheduling with set-ups , 2008, Discret. Appl. Math..

[2] Kenneth R. Baker,et al. Lower bounds and algorithms for flowtime minimization on a single machine with set-up times , 2000 .

[3] Andrew Wirth,et al. A New Heuristic for a Single Machine Scheduling Problem with Set-up Times , 1996 .

[4] Chris N. Potts,et al. Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[5] T. C. Edwin Cheng,et al. Single machine batch scheduling problem with family setup times and release dates to minimize makespan , 2006, J. Sched..

[6] J. Gupta. Single facility scheduling with multiple job classes , 1988 .

[7] Jatinder N. D. Gupta,et al. A review of scheduling research involving setup considerations , 1999 .

[8] Lele Zhang,et al. On-line machine scheduling with batch setups , 2010, J. Comb. Optim..

[9] Han Hoogeveen,et al. Optimal On-Line Algorithms for Single-Machine Scheduling , 1996, IPCO.

[10] Edward Anderson,et al. Minimizing flow time on a single machine with job classes and setup times , 1991 .