Article ID: | iaor20081707 |
Country: | China |
Volume: | 20 |
Issue: | 1 |
Start Page Number: | 19 |
End Page Number: | 25 |
Publication Date: | Jun 2006 |
Journal: | Communication on Applied Mathematics and Computation |
Authors: | Zou Juan |
In this paper, we first study the problem of scheduling jobs with chain precedence constraints on a batching machine to minimize makespan. We present a polynomial algorithm for such a problem, where n jobs in one chain, a constant number of jobs in the other chains. We also give some polynomial algorithms for several special cases.