A linear time algorithm for restricted bin packing and scheduling problems
From MaRDI portal
Cites work
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Bin packing can be solved within 1+epsilon in linear time
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Deadline scheduling of tasks with ready times and resource constraints
- scientific article; zbMATH DE number 3757696 (Why is no real title available?)
- scientific article; zbMATH DE number 3537796 (Why is no real title available?)
- scientific article; zbMATH DE number 3604658 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Resource constrained scheduling as generalized bin packing
- Scheduling subject to resource constraints: Classification and complexity
Cited in
(10)- Scheduling tasks on two processors with deadlines and additional resources
- Minimizing mean flow time with parallel processors and resource constraints
- New trends in machine scheduling
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Online bin packing with advice
- Scheduling: agreement graph vs resource constraints
- Unit-time scheduling problems with time dependent resources
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
This page was built for publication: A linear time algorithm for restricted bin packing and scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837623)
