Semi-online scheduling with known partial information about job sizes on two identical machines

DOI10.1016/j.tcs.2011.03.032zbMath1216.68061OpenAlexW1986230036MaRDI QIDQ551204

Qian Cao, Zhaohui Liu, Cheng, T. C. Edwin

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.032

zbMATH Keywords

schedulingsemi-onlineidentical machinesmaximum job

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling: a survey ⋮ Several semi-online scheduling problems on two identical machines with combined information ⋮ Semi-online scheduling with combined information on two identical machines in parallel ⋮ Online Order Scheduling Problem with the Same Order Size on Two Identical Machines

Cites Work

• Semi-online scheduling problems on two identical machines with inexact partial information
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Bin stretching revisited
• Semi-on-line problems on two identical machines with combined partial information
• Bounds for Certain Multiprocessing Anomalies
• Semi-online scheduling with decreasing job sizes
• Unnamed Item