This is a preview. Log in through your library . Abstract Application is made to the preference order dynamic programming solution procedure proposed by Kao for a stochastic traveling salesman problem ...

We discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available ...