排序方式: 共有1条查询结果,搜索用时 15 毫秒
1
1.
In this article we consider the problem of minimizing the maximum completion time of a sequence of n jobs on a single machine. Nonzero ready times and sequence-dependent processing times are allowed. Upper bounds, lower bounds, and dominance criteria are proposed and exploited in a branch-and-bound algorithm. Computational results are given. 相似文献
1