Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959701 | European Journal of Operational Research | 2017 | 6 Pages |
Abstract
The paper analyzes the influence, exerted by the mutual relations of deadline intervals on behavior of the optimal solution values for the random Sequencing Jobs with Deadlines (SJD) problems. An asymptotically sub-optimal algorithm is proposed. It is assumed that the problem coefficients are realizations of independent uniformly distributed random variables and deadlines are deterministic. The results, presented in the paper, significantly extend knowledge on behavior of the optimal solutions to the SJD problem in the asymptotical case.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Krzysztof SzkatuÅa,