On stochastic scheduling with precedence relations and switching costs
1980 ◽
Vol 17
(4)
◽
pp. 1016-1024
◽
Keyword(s):
A collection of jobs is to be processed by a single machine. The amount of processing required by each job is a random variable with a known probability distribution. The jobs must be processed in a manner which is consistent with a precedence relation but the machine is free to switch from one job to another at any time; such switches are costly, however. This paper discusses conditions under which there is an optimal strategy for allocating the machine to the jobs which is given by a fixed permutation of the jobs indicating in which order they should be processed. When this is so, existing algorithms may be helpful in giving the best job ordering.
1980 ◽
Vol 17
(04)
◽
pp. 1016-1024
◽
1995 ◽
Vol 87
(2)
◽
pp. 284-288
◽
Keyword(s):
2016 ◽
Vol 5
(4)
◽
pp. 106-113
◽
2012 ◽
Vol 7
(2)
◽
pp. 110-118
◽
1978 ◽
Vol 40
(3)
◽
pp. 322-327
◽