scientific article; zbMATH DE number 1305482
From MaRDI portal
Publication:4252370
zbMath1052.90549MaRDI QIDQ4252370
April Rasala, Javed A. Aslam, Neal E. Young, Clifford Stein
Publication date: 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Related Items
A note on scheduling to meet two min-sum objectives ⋮ Bicriteria approximation algorithms for scheduling problems with communications delays ⋮ Trading off worst and expected cost in decision tree problems ⋮ Fair online load balancing ⋮ On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. ⋮ An improved lower bound for a bi-criteria scheduling problem ⋮ The constrained minimum weighted sum of job completion times problem ⋮ Approximation algorithms for the bi-criteria weighted MAX-CUT problem ⋮ Parallel machine makespan minimization subject to machine availability and total completion time constraints ⋮ Approximation results for a bicriteria job scheduling problem on a single machine without preemption ⋮ Multicriteria scheduling ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time ⋮ A new approach for bicriteria partitioning problem
This page was built for publication:
