Semi-on-line problems on two identical machines with combined partial information

DOI10.1016/S0167-6377(02)00164-5zbMath1013.90064OpenAlexW2053558677MaRDI QIDQ1870021

Yong He, Zhiyi Tan

Publication date: 4 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00164-5

zbMATH Keywords

approximation algorithmcompetitive analysisparallel machine schedulingsemi-on-line

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (28)

A survey on makespan minimization in semi-online environments ⋮ Linear time algorithms for parallel machine scheduling ⋮ Semi-online machine covering on two uniform machines with known total size ⋮ Online and semi-online scheduling of two machines under a grade of service provision ⋮ Optimal semi-online algorithms for machine covering ⋮ Semi-online scheduling for jobs with release times ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling problems on two identical machines with inexact partial information ⋮ Semi-online scheduling problems on a small number of machines ⋮ Bin stretching with migration on two hierarchical machines ⋮ Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines ⋮ ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Semi-online scheduling with ``end of sequence information ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ List scheduling for jobs with arbitrary release times and similar lengths ⋮ Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines ⋮ Best semi-online algorithms for unbounded parallel batch scheduling ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ Machine covering with combined partial information ⋮ Semi-online scheduling with known partial information about job sizes on two identical machines ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Several semi-online scheduling problems on two identical machines with combined information ⋮ Semi-online scheduling with combined information on two identical machines in parallel ⋮ Two semi-online scheduling problems on two uniform machines ⋮ Online Order Scheduling Problem with the Same Order Size on Two Identical Machines ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs

Cites Work

• Unnamed Item
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• The optimal on-line parallel machine scheduling
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
• A note on on-line scheduling with partial information
• Ordinal algorithms for parallel machine scheduling
• Semi-online scheduling with decreasing job sizes
• Semi-on-line scheduling with ordinal data on two uniform machines

This page was built for publication: Semi-on-line problems on two identical machines with combined partial information