【作者】 贾春福； 李勇建； 涂奉生；

【Author】 Jia Chunfu Li Yongjian Tu Fengsheng (Department of Automatic, Nankai Umversity, Tianjin 300071)

【机构】 南开大学计算机与系统科学系；

【摘要】 本文利用随机Flow Shop的一个性质,讨论了同一工件在不同机器上的加工时间独立同分布时,m台机器Flow Shop随机调度问题．机器之间具有存储器,其容量充分大,使得加工过程不会出现阻塞．目标函数分别为: (1)工件完成时间和的期望, (2)工件拖后时间和的期望和(3) 拖后工件数．在加工时间可随机比较大小时,给出了上述目标函数最小化问题的最优解．更多还原

【Abstract】 In this paper, scheduling problems for minimizing (1) the expected total completion times. (2) the expected total tardiness costs and (3) the number .of tardy jobs in m-machine flow show are considered under the assumption that the processing times of a job on different machines are independent and identically distributed random variables. There is an intermediate storage with infinite capacity between any two machines in this model. When the processing times can be stochastically ordered, the optimal sequences are derived for the problems.更多还原