Pages that link to "Item:Q1375117"
From MaRDI portal
The following pages link to On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117):
Displayed 24 items.
- Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness (Q306084) (← links)
- An almost tight lower bound for the scheduling problem to meet two min-sum objectives (Q384219) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Fair online load balancing (Q398848) (← links)
- Multi-criteria scheduling: an agent-based approach for expert knowledge integration (Q398857) (← links)
- Simultaneous approximation of multi-criteria submodular function maximization (Q489121) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Bi-objective matchings with the triangle inequality (Q515541) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- An improved lower bound for a bi-criteria scheduling problem (Q924887) (← links)
- How good are SPT schedules for fair optimality criteria (Q940873) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Fairness in parallel job scheduling (Q1588058) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem (Q2499589) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- A note on scheduling to meet two min-sum objectives (Q2643821) (← links)
- Bi-objective cell loading problem with non-zero setup times with fuzzy aspiration levels in labour intensive manufacturing cells (Q5444618) (← links)
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times (Q6179222) (← links)