scientific article; zbMATH DE number 850325
From MaRDI portal
Publication:4866348
zbMATH Open0861.90070MaRDI QIDQ4866348FDOQ4866348
Authors: P. I. Sharygin 
Publication date: 2 September 1996
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1560337
- On approximating a scheduling problem
- scientific article; zbMATH DE number 1182771
- Towards tight lower bounds for scheduling problems
- On the approximability of an interval scheduling problem
- On the optimality of exact and approximation algorithms for scheduling problems
- Approximate solution of a resource-constrained scheduling problem
- Approximating Interval Scheduling Problems with Bounded Profits
- Approximation algorithms for some discrete-continuous scheduling problems
- Approximation algorithms for time constrained scheduling
Cited In (10)
- Approximation of the supply scheduling problem
- Approximately Supermodular Scheduling Subject to Matroid Constraints
- On Graham's bound for cyclic scheduling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tighter approximation bounds for LPT scheduling in two special cases
- Bounds for naive multiple machine scheduling with release times and deadlines
- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
- Title not available (Why is that?)
- Approximate solution of a resource-constrained scheduling problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4866348)
