ISSN:0028-1441    

DOI:10.1002/nav.3800210112

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper considers situations in which jobs require only one operation on a single machine, or on one of a set of identical machines. Penalty‐free interruption is allowed. Some simple algorithms are given for finding optimum schedules to minimize maximum lateness and total delay, for the single‐machine case, and maximum lateness for a restricted multi‐machine case. A simple flow problem formulation permits minimizing maximum lateness for the more general multimachine

ISSN:0028-1441    

DOI:10.1002/nav.3800210113

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractA basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study.

ISSN:0028-1441    

DOI:10.1002/nav.3800210114

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper presents a simple algorithm for finding the number of restrictedk‐partitions of a natural numbern.The unrestrictedk‐partitions ofnare expressed as the sum of these restrictedk‐partitions, called inadmissible, and the admissiblek‐partitions. The simplicity of the algorithm is striking, though all the implications are

ISSN:0028-1441    

DOI:10.1002/nav.3800210115

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractConsider the problem of computing an offset circle probability under a normal distribution. One approach is to utilize an infinite series representation in which case it is important to have rapid convergence and a good upper bound on the error introduced by consideration of only a finite number of terms of the series. We relate three seemingly different series representations. In particular we show how two series representations for the bivariate case can be obtained by specializing more general results of Harold Ruben.

ISSN:0028-1441    

DOI:10.1002/nav.3800210116

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800210101

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY