Title:

Random scheduling (sequencing) jobs with deadlines problem : Deadliness intervals impact on the optimal solution values behavior

Subtitle:

Raport Badawczy = Research Report ; RB/26/2015

Creator:

Szkatuła, Krzysztof

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Date issued/created:

2015

Description:

12 pages ; 21 cm ; Bibliography p. 12

Subject and Keywords:

Problem plecakowy ; Analiza probabilistyczna ; Probabilistic analysis ; Knapsack problem ; Algorytm przybliżony ; Scheduling ; Approximate algorithm ; Planowanie

Abstract:

In the paper influence of the deadliness mutual relations (deadliness intervals) on the asymptotical optimal solution values behavior, where total profit is maximized, is considered for the case of the random Sequencing Jobs with Deadlines (SJD) problems. Asymptotically sub optimal algorithm has been proposed. It is assumed that problem coefficients are realizations of independent, uniformly distributed over [0, 1) random variables, n goes to infinity, with deadlines remaining deterministic.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2015-26

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open