Random sequencing jobs with deadlines problem: Growth of the optimal solution values

Random sequencing jobs with deadlines problem: Growth of the optimal solution values

0.00 Avg rating0 Votes
Article ID: iaor19993102
Country: Netherlands
Volume: 109
Issue: 1
Start Page Number: 160
End Page Number: 169
Publication Date: Aug 1998
Journal: European Journal of Operational Research
Authors:
Keywords: programming: integer, scheduling
Abstract:

In the paper an asymptotic value of the sequencing jobs with deadlines (SJD) problem is computed for the case of the random SJD problems. It is assumed that problem coefficients are realizations of independent, uniformly distributed over [0,1) random variables, n→∞ with deadlines remaining deterministic.

Reviews

Required fields are marked *. Your email address will not be published.