A Special Three-machine Production Scheduling with Stochastic Breakdowns

摘要：

The problem of scheduling a three-machine flowshop, where machines suffer random breakdowns,is addressed with respect to the makespan objective. For our problem, obtaining an optimal schedule by implicit enumeration techniques (after dominance relations are established) is very hard, mainly due to the total idle time on machine 3. That is because it is the maximum of n terms, each of which includes the difference of two random sums of random variables, and furthermore, the terms are dependent. A dominance relation for minimizing makespan with probability 1 is established in the flowshop where machines suffer random breakdowns and processing time of the middle machine is equal. Furthermore, it is shown that Szwarcs algorithm for the deterministic problem stochastically minimizes makespan when random breakdowns are present.

关键词： flowshop machine breakdowns makespan realization algorithm.

作者: Yang Li Fanhui Zeng

作者单位: Shenyang Institute of Chemical TechnologyShenyang, China College of Science Liaoning Technical University Fuxin, China

会议类型: 国际会议

会议名称: 2007 Conference on Systems Science, Management Science and System Dynamics(第二届系统科学、管理科学与系统动力学国际会议)

会议地点: 上海

会议语种:英文

页码: 1247-1252

在线出版日期: 2007-10-19（万方平台首次上网日期，不代表论文的发表时间）