Article ID: | iaor1989182 |
Country: | United States |
Volume: | 37 |
Issue: | 4 |
Start Page Number: | 592 |
End Page Number: | 600 |
Publication Date: | Jul 1989 |
Journal: | Operations Research |
Authors: | Dobson Gregory, Karmarkar Uday S. |
Keywords: | programming: integer |
Many scheduling problems in manufacturing and service firms involve tasks that require more than one resource to be used simultaneously to execute the task. Two formulations of this scheduling problem are given. The authors develop a Lagrangian relaxation for the problem that has an intuitive interpretation. The relaxation suggests heuristics and provides a lower bound on the optimal solution. Next a surrogate relaxation is developed that provides a second bound and a heuristic solution. An enumeration procedure to determine the optimal solution is described, and computational results on the effectiveness of the bounds and the heuristics are presented. The Lagrangian relaxation performs better on problems with a low degree of simultaneity, and the surrogate relaxation does better with a high degree of simultaneity.