| Article ID: | iaor20106821 |
| Volume: | 20 |
| Issue: | 3 |
| Start Page Number: | 285 |
| End Page Number: | 306 |
| Publication Date: | Oct 2010 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Wirth Andrew, Zhang Lele |
| Keywords: | heuristics |
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch start and complete together, and a constant setup is prior to each batch. The objective is to minimize the total completion time of all jobs. We primarily consider the special cases of these problems with identical processing times, for which efficient on-line heuristics are proposed and their competitive performance is evaluated.