An ordered independence system and its applications to scheduling problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3957178
- A note to independent sets in scheduling
- scientific article; zbMATH DE number 512916
- scientific article; zbMATH DE number 4099022
- Order Scheduling Models: Hardness and Algorithms
- scientific article; zbMATH DE number 3941255
- Partially ordered knapsack and applications to scheduling
- scientific article; zbMATH DE number 5605136
- Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system
- On the Optimal Scheduling of Independent, Symmetric and Time-Sensitive Tasks
Cites work
- scientific article; zbMATH DE number 3858856 (Why is no real title available?)
- scientific article; zbMATH DE number 3873052 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
Cited in
(2)
This page was built for publication: An ordered independence system and its applications to scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330565)