Several semi-online scheduling problems on two identical machines with combined information

DOI10.1016/j.tcs.2012.07.005zbMath1252.68045MaRDI QIDQ714838

Qian Cao, Guohua Wan, Yi Li, Cheng, T. C. Edwin

Publication date: 11 October 2012

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

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

zbMATH Keywords

scheduling; buffer; combined information; semi-online; identical machines

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W27: Online algorithms; streaming algorithms

Related Items

A survey on makespan minimization in semi-online environments, Semi-online scheduling: a survey

Cites Work

• Unnamed Item
• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• Semi-online scheduling with known partial information about job sizes on two identical machines
• 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
• Semi-online algorithms for parallel machine scheduling problems
• Bounds for Certain Multiprocessing Anomalies
• Semi-online scheduling with decreasing job sizes
• On-line bin-stretching