Random sequencing jobs with deadlines problem: Growth of the optimal solution values
| Autor: | Krzysztof Szkatuła |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
Discrete mathematics
Mathematical optimization Information Systems and Management General Computer Science Modeling and Simulation Combinatorial optimization Management Science and Operations Research Computer Science::Operating Systems Integer programming Random variable Industrial and Manufacturing Engineering Mathematics Scheduling (computing) |
| Zdroj: | European Journal of Operational Research. 109:160-169 |
| ISSN: | 0377-2217 |
| DOI: | 10.1016/s0377-2217(97)00096-9 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect