摘要:

AbstractThe ordered flow shop sequencing problem with no in-processing waiting (OFSNW) is considered with respect to mean flow time criterion. It is shown that the sequence in which jobs are arranged according to the shortest processing time rule (SPT) represents an optimal sequence. Additional results for the makespan criterion are also discussed.

ISSN:0160-5682    

DOI:10.1057/jors.1980.191

出版商:Taylor&Francis    

年代:1980

数据来源: Taylor

摘要:

AbstractIn usual stochastic programming problems involving randomly distributed "resources" and chance constraints, decision variables are taken as deterministic. With the help of simple illustrations involving a single decision variable, Vajda and Greenberg showed that minimum expected values could be made smaller by treating the decision variable as random. This idea has been extended here to the case of two decision variables. The difficulty of finding an optimal mixed strategy in the case of an infinite-range distribution of the decision variable(s) has also been shown.

ISSN:0160-5682    

DOI:10.1057/jors.1980.192

出版商:Taylor&Francis    

年代:1980

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1980.193

出版商:Taylor&Francis    

年代:1980

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1980.194

出版商:Taylor&Francis    

年代:1980

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1980.195

出版商:Taylor&Francis    

年代:1980

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1980.196

出版商:Taylor&Francis    

年代:1980

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1980.198

出版商:Taylor&Francis    

年代:1980

数据来源: Taylor