Following a long-standing suggestion by Samuels and Steele we study the problem of sequential selection of an increasing subsequence from a random sample of size N, where N is geometrically ...
This paper considers the problem of scheduling a given number of jobs on a single machine to minimize the sum of maximum earliness and maximum tardiness when sequence-dependent setup times exist (1ǀST ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback