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

DOI10.1016/S0377-2217(97)00096-9zbMath0951.90024MaRDI QIDQ1296705

Krzysztof Szkatuła

Publication date: 3 January 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingscheduling problemscombinatorial optimisationworst caseprobabilistic analyses

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• On the growth of random knapsacks
• The growth of m-constraint random knapsacks
• A note on sequencing jobs with deadlines problem
• Random knapsacks with many constraints
• The growth of multi-constraint random knapsack with various right-hand sides of the constraints
• The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
• Algorithms for Scheduling Independent Tasks
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems