Semi-on-line scheduling with ordinal data on two uniform machines

DOI10.1016/S0167-6377(01)00071-2zbMath0992.90031OpenAlexW1966517735MaRDI QIDQ5945393

Zhiyi Tan, Yong He

Publication date: 10 October 2001

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00071-2

zbMATH Keywords

schedulingcompetitive ratiomakespananalysis of algorithmonlineuniform machines

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (12)

A survey on makespan minimization in semi-online environments ⋮ \(\kappa\)-partitioning problems for maximizing the minimum load ⋮ SEMI-ONLINE MACHINE COVERING ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling with known maximum job size on two uniform machines ⋮ Parallel solutions for ordinal scheduling with a small number of machines ⋮ Semi-online scheduling with machine cost. ⋮ 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 ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ Semi-on-line problems on two identical machines with combined partial information

Cites Work

• Unnamed Item
• Unnamed Item
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Ordinal algorithms for parallel machine scheduling
• Bin packing using semi-ordinal data
• Bounds for List Schedules on Uniform Processors
• Semi-online scheduling with decreasing job sizes
• Semi-on-line scheduling problems for maximizing the minimum machine completion time

This page was built for publication: Semi-on-line scheduling with ordinal data on two uniform machines