ON THE k-TRUCK SCHEDULING PROBLEM

DOI10.1142/S0129054104002340zbMath1105.90025OpenAlexW2168596116MaRDI QIDQ5696969

Kanliang Wang, Jane You, James N. K. Liu, Yin-Feng Xu, Wei-Min Ma

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

competitive ratioon-line algorithm\(k\)-truck problempartial-greedy algorithmposition maintaining strategy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Competitive analysis for the on-line truck transportation problem

Cites Work

• Online algorithms. The state of the art
• Competitive snoopy caching
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• Competitive algorithms for server problems
• New Algorithms for Bin Packing
• An optimal on-line algorithm for metrical task system
• On the k -server conjecture
• The Bay Restaurant--A Linear Storage Problem
• On-line \(k\)-truck problem and its competitive algorithms.

This page was built for publication: ON THE k-TRUCK SCHEDULING PROBLEM