This paper considers scheduling n jobs on a single machine where the job processing times anddue dates are independent random variables with arbitrary distribution functions.We consider the casethat the weighted job t...This paper considers scheduling n jobs on a single machine where the job processing times anddue dates are independent random variables with arbitrary distribution functions.We consider the casethat the weighted job tardiness in expectation is minimized.It is assumed that job's due dates arecompatible with processing times and weights.We show that the jobs should be sequenced indecreasing stochastic order of their due dates.展开更多
We consider a manpower planning problem with single employee type over a long planning horizon and analyze the optimal recruitment and dismissal polices. Dynamic demands for manpower must be fulfilled by allocating en...We consider a manpower planning problem with single employee type over a long planning horizon and analyze the optimal recruitment and dismissal polices. Dynamic demands for manpower must be fulfilled by allocating enough number of employees. Costs for every employee include salary, recruitment and dismissal costs, in particular, setup costs when recruitment/dismissal activities occur. We formulate the problem as a multi-period decision model. Then we analyze properties of the problem and give an improved dynamic programming algorithm to minimize the total cost over the entire planning horizon. We report computational results to illustrate the effectiveness of the approach.展开更多
文摘This paper considers scheduling n jobs on a single machine where the job processing times anddue dates are independent random variables with arbitrary distribution functions.We consider the casethat the weighted job tardiness in expectation is minimized.It is assumed that job's due dates arecompatible with processing times and weights.We show that the jobs should be sequenced indecreasing stochastic order of their due dates.
文摘We consider a manpower planning problem with single employee type over a long planning horizon and analyze the optimal recruitment and dismissal polices. Dynamic demands for manpower must be fulfilled by allocating enough number of employees. Costs for every employee include salary, recruitment and dismissal costs, in particular, setup costs when recruitment/dismissal activities occur. We formulate the problem as a multi-period decision model. Then we analyze properties of the problem and give an improved dynamic programming algorithm to minimize the total cost over the entire planning horizon. We report computational results to illustrate the effectiveness of the approach.
