Article ID: | iaor20063635 |
Country: | United States |
Volume: | 16 |
Issue: | 2 |
Start Page Number: | 198 |
End Page Number: | 208 |
Publication Date: | Mar 2004 |
Journal: | INFORMS Journal On Computing |
Authors: | Sourd Francis |
Keywords: | scheduling, programming: branch and bound |
This paper focuses on the continuous assignment problem with the eventual aim to solve scheduling problems with irregular cost functions. It consists of partitioning a region of ℝ