[1]CUNNINGHAM A A, DUTTA S K. Scheduling jobs with exponentially distributed processing times on two machines of a flow shop[J]. Naval Research Logistics Quarterly, 1972, 16(1):69-81. [2]GROURGAND M, GRANGEON N, NORRE S. A contribution to the stochastic flow shop scheduling problem[J]. European Journal of Operation Research, 2003, 151(2):415-433.
[3]ALLAHVERDI A, MITTENTHAL J. Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function[J]. European Journal of Operation Research, 1995, 81(2):376-387.
[4]ALCAIDE D, RODRIGUEZ-GONZALEZ A, SICILIA A. An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns[J]. European Journal of Operation Research, 2002, 140(2):384-398.
[5]AYTUG H, LAWLEY M A, MCKAY K, et al. Executing production schedules in the face of uncertainties: a review and some future directions[J]. European Journal of Operation Research, 2005,161(1):86-110.
[6]JIA Chunfu. Stochastic single machine scheduling with exponentially distributed processing tims[J]. System Engineering, 2002,20(6):58-61(in Chinese).[贾春福,加工时间服从指数分布的单机随机调度问题[J].系统工程,2002,20(6):58-61.]
[7]LI W, CAO J H. Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities [J]. Operations Research Letters, 1995, 18(2):81-91.
|