News
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results