Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems

From MaRDI portal
Publication:5388006

DOI10.1287/moor.1060.0218zbMath1278.90146OpenAlexW2097078863WikidataQ56004686 ScholiaQ56004686MaRDI QIDQ5388006

Rafail Ostrovsky, Julia Chuzhoy, Yuval Rabani

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6187aed77b89809a9a04c8786209da90a9dce89c




Related Items

Inverse interval scheduling via reduction on a single machineOn the fine-grained parameterized complexity of partial scheduling to minimize the makespanOn Lagrangian relaxation for constrained maximization and reoptimization problemsNon-preemptive speed scalingInterval scheduling and colorful independent setsMin Sum Edge Coloring in Multigraphs Via Configuration LPThe complexity of the timetable‐based railway network design problemUnnamed ItemUnnamed ItemBreaking 1 - 1/e Barrier for Nonpreemptive Throughput MaximizationBandwidth allocation in cellular networks with multiple interferencesMaximizing Throughput in Flow Shop Real-Time SchedulingImproving LTL truck load utilization on lineGrasp and delivery for moving objects on broken linesExact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environmentOn Lagrangian Relaxation and Subset Selection ProblemsBalanced splitting on weighted intervalsThe temporal explorer who returns to the baseThroughput scheduling with equal additive laxityThroughput scheduling with equal additive laxityScheduling with a minimum number of machinesBandwidth-constrained allocation in grid computingPriority algorithms for the subset-sum problemApproximating Interval Selection on Unrelated Machines with Unit-Length Intervals and CoresA polynomial-time approximation scheme for the airplane refueling problemEfficient job scheduling algorithms with multi-type contentions