ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES

DOI10.1142/S0217595911003119zbMath1211.90096OpenAlexW2153950656MaRDI QIDQ2998841

Zhiyi Tan, An Zhang, Yiwei Jiang

Publication date: 11 May 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595911003119

zbMATH Keywords

schedulingcompetitive analysisdesign and analysis of algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items

Online scheduling for outpatient services with heterogeneous patients and physicians

Cites Work

• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Semi on-line algorithms for the partition problem
• Machine scheduling with availability constraints
• Current trends in deterministic scheduling
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Semi-on-line problems on two identical machines with combined partial information
• Makespan minimization for two parallel machines with an availability constraint
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Semi-online scheduling with decreasing job sizes
• On-line bin-stretching