Scheduling with tree-hierarchical processing set restrictions
From MaRDI portal
Recommendations
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Fast approximation algorithms for job scheduling with processing set restrictions
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
This page was built for publication: Scheduling with tree-hierarchical processing set restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986067)