Simultaneous Resource Scheduling to Minimize Weighted Flow Times
From MaRDI portal
Publication:3830804
DOI10.1287/opre.37.4.592zbMath0675.90043OpenAlexW2121686914MaRDI QIDQ3830804
Uday S. Karmarkar, Gregory Dobson
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.4.592
heuristicsLagrangian relaxationenumerationlower boundoptimal solutionsurrogate relaxationweighted flow times
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Related Items (8)
Mass customization in videotape duplication and conversion: challenges of flexible duplication systems, fast delivery, and electronic service ⋮ A simple linear time approximation algorithm for multi-processor job scheduling on four processors ⋮ The scheduling problem where multiple machines compete for a common local buffer ⋮ Min Sum Edge Coloring in Multigraphs Via Configuration LP ⋮ Scheduling multiprocessor tasks -- An overview ⋮ Scheduling two parallel semiautomatic machines to minimize machine interference ⋮ Simulated annealing for resource-constrained scheduling ⋮ Approximation algorithms for general parallel task scheduling
This page was built for publication: Simultaneous Resource Scheduling to Minimize Weighted Flow Times
