A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length |
| |
Authors: | I Adiri E Frostig |
| |
Institution: | Faculty of Industrial Engineering and Management, Technion City, Haifa 32 000, Israel |
| |
Abstract: | Consider n jobs (J1,J2,…,Jn) and m machines (M1,M2…,Mm). Upon completion of processing of Ji, 1 ? i ? n, on Mj 1 ? j ? m ? 1, it departs with probability pi or moves to Mj+1 with the complementary probability, 1?pi. A job completing service on Mm departs. The processing time of ji on Mj possesses a distribution function Fj. It is proved that sequencing the jobs in a nondecreasing order of pi minimizes in distribution the schedule length. |
| |
Keywords: | stochastic scheduling stochastic permutation-flowshop |
本文献已被 ScienceDirect 等数据库收录! |
|