The following pages link to (Q4796176):
Displaying 15 items.
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
- Analyzing scheduling with transient failures (Q987815) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- FPTAS for the two identical parallel machine problem with a single operator under the free changing mode (Q1752167) (← links)
- One-exact approximate Pareto sets (Q2038919) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Approximating Scheduling Machines with Capacity Constraints (Q5321720) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
- Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan (Q6594026) (← links)
