Bilevel adversarial scheduling problem on parallel machines
From MaRDI portal
Cites work
- A unified framework for designing EPTAS for load balancing on parallel machines
- An approximation algorithm for the generalized assignment problem
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- Approximation algorithms for interdiction problem with packing constraints
- Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
- Approximation algorithms for the integrated path and bin packing problem
- Approximation schemes for scheduling on parallel machines
- Bilevel programming applied to the flow shop scheduling problem
- Bilevel programming approach applied to the flow shop scheduling problem under fuzziness
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Closing the gap for makespan scheduling via sparsification techniques
- Constraint programming approach to a bilevel scheduling problem
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Multiagent scheduling. Models and algorithms
- On bilevel machine scheduling problems
- Penalty cost constrained identical parallel machine scheduling problem
- Single machine adversarial bilevel scheduling problems
This page was built for publication: Bilevel adversarial scheduling problem on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6867293)
