On the minimization of the weighted number of tardy jobs with random processing times and deadline

Authors:
Prabuddha De;Jay B. Ghosh;Charles E. Wells
Affiliations:
Univ. of Dayton, Dayton, OH;Univ. of Dayton, Dayton, OH;Univ. of Dayton, Dayton, OH
Venue:
Computers and Operations Research
Year:
1991

Citing 0
Cited 4

Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models

Computers and Industrial Engineering
Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models

Computers and Industrial Engineering
Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

Computers and Operations Research
Minimizing the expected number of tardy jobs when processing times are normally distributed

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract