Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892989 | Computers & Operations Research | 2014 | 6 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Kenneth R. Baker,