Random sequencing jobs with deadlines problem: Growth of the optimal solution values
From MaRDI portal
Publication:1296705
DOI10.1016/S0377-2217(97)00096-9zbMATH Open0951.90024MaRDI QIDQ1296705FDOQ1296705
Authors: Krzysztof Szkatula 
Publication date: 3 January 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem
- Job selection and sequencing on a single machine in a random environment
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- Optimal due-date determination and sequencing with random processing times
Cites Work
- Title not available (Why is that?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithms for Scheduling Independent Tasks
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Random knapsacks with many constraints
- Title not available (Why is that?)
- 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
- On the growth of random knapsacks
- The growth of m-constraint random knapsacks
- A note on sequencing jobs with deadlines problem
Cited In (2)
This page was built for publication: Random sequencing jobs with deadlines problem: Growth of the optimal solution values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296705)
