| Article ID: | iaor20141054 |
| Volume: | 41 |
| Issue: | 6 |
| Start Page Number: | 109 |
| End Page Number: | 114 |
| Publication Date: | Jan 2014 |
| Journal: | Computers and Operations Research |
| Authors: | Baker Kenneth R |
| Keywords: | combinatorial optimization, stochastic processes, programming: branch and bound |
We examine a basic stochastic sequencing model with due dates as decisions. The objective is to make due dates as tight as possible while meeting service level constraints. We develop an optimizing procedure using branch and bound, and we evaluate the performance of heuristic procedures as well.