000 | 01446nab a22002297 4500 | ||
---|---|---|---|
001 | H004.COM | ||
003 | AR-sfUTN | ||
008 | 190909b xx |||p|r|||| 00| 0 spa d | ||
040 | _cAR-sfUTN | ||
080 | _aH004.COM | ||
100 | _aMoon, Ilkyeong | ||
700 | _aYun, Wonyoung | ||
245 | _aThe distribution free job control problem | ||
336 |
_2rdacontent _atexto _btxt |
||
337 |
_2rdamedia _asin mediaciĆ³n _bn |
||
338 |
_2rdacarrier _avolumen _bnc |
||
505 | _aThe job control problem is to determine an optimal release time where the flow time is a random variable with a known probability distribution. There is a trade-off between the penalty cost for late delivery and the holding cost for early finish. C. Liao [Computers Industrial Engineering, 22, 163-169 (1992)] formulated this problem and provided a practical decision procedure. This paper addresses the job control problem where only the mean and the variance of the flow time are known. The motivation of this paper comes from the fact that the distributional information on the flow time is usually limited for some job shops. We provide a simple line search algorithm to find a job release time which can be used in the absence of the distributional information | ||
650 | _aDISTRIBUTION FREE JOB CONTROL | ||
773 |
_tComputers and industrial engineering _wH004.COM _nS.T.:H004.COM PP2661 _g(vol. 32, nro. 1, Jan. 1997), p. 109-113 |
||
942 | _cAN | ||
999 |
_c35352 _d35352 |