Ordinal on-line scheduling for maximizing the minimum machine completion time
From MaRDI portal
Publication:1598882
DOI10.1023/A:1013855712183zbMath0991.90069OpenAlexW1505187008MaRDI QIDQ1598882
Publication date: 28 May 2002
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013855712183
Related Items (20)
\(\kappa\)-partitioning problems for maximizing the minimum load ⋮ Comparing the minimum completion times of two longest-first scheduling-heuristics ⋮ SEMI-ONLINE MACHINE COVERING ⋮ Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines ⋮ SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES ⋮ Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines ⋮ Improved approaches to the exact solution of the machine covering problem ⋮ Semi-online scheduling: a survey ⋮ Parallel solutions for ordinal scheduling with a small number of machines ⋮ Polynomial-time combinatorial algorithm for general max-min fair allocation ⋮ General max-min fair allocation ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Approximation schemes for scheduling and covering on unrelated machines ⋮ Dividing a Territory Among Several Vehicles ⋮ Maximizing the minimum completion time on parallel machines ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ Preemptive machine covering on parallel machines ⋮ Semi-on-line problems on two identical machines with combined partial information
This page was built for publication: Ordinal on-line scheduling for maximizing the minimum machine completion time
