Approximately Supermodular Scheduling Subject to Matroid Constraints

DOI10.1109/TAC.2021.3071024OpenAlexW3149403658MaRDI QIDQ5090799FDOQ5090799

Authors: Luiz F. O. Chamon, Alexandre Amice, Alejandro Ribeiro 

Publication date: 21 July 2022

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.08841

Recommendations

• A supermodular relaxation for scheduling with release dates
• Approximating multi-objective scheduling problems
• On the optimality of exact and approximation algorithms for scheduling problems
• On approximating a scheduling problem
• scientific article; zbMATH DE number 1560337
• scientific article; zbMATH DE number 850325
• Approximating vector scheduling: almost matching upper and lower bounds
• Approximating vector scheduling: almost matching upper and lower bounds
• Approximation algorithms for the multiprocessor scheduling with submodular penalties
• scientific article; zbMATH DE number 1060044

Mathematics Subject Classification ID

Systems theory; control (93-XX)

This page was built for publication: Approximately Supermodular Scheduling Subject to Matroid Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090799)