Article ID: | iaor20041015 |
Country: | Germany |
Volume: | 57 |
Issue: | 1 |
Start Page Number: | 111 |
End Page Number: | 123 |
Publication Date: | Jan 2003 |
Journal: | Mathematical Methods of Operations Research (Heidelberg) |
Authors: | Munier A., Sourd F. |
Chains of operations have to be scheduled on a single machine such that a minimum delay is set between any two operations linked by a precedence relation. Three sub-problems are shown to be solved in polynomial time. First, we consider the problem of minimizing the makespan when all the operations have the same duration