ON THE k-TRUCK SCHEDULING PROBLEM
DOI10.1142/S0129054104002340zbMATH Open1105.90025OpenAlexW2168596116MaRDI QIDQ5696969FDOQ5696969
Authors: Jane You, J. Liu, Kanliang Wang, Weimin Ma, Yinfeng Xu 
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
Recommendations
competitive ratioon-line algorithm\(k\)-truck problempartial-greedy algorithmposition maintaining strategy
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Online algorithms. The state of the art
- Competitive snoopy caching
- An Optimal On-Line Algorithm for K Servers on Trees
- Competitive algorithms for server problems
- New Algorithms for Bin Packing
- An optimal on-line algorithm for metrical task system
- On the k -server conjecture
- New Ressults on Server Problems
- On-line \(k\)-truck problem and its competitive algorithms.
- The Bay Restaurant--A Linear Storage Problem
Cited In (8)
- Optimal scheduling of trucks for the clearance of garbage of a city
- Title not available (Why is that?)
- The Canadian minimum duration truck driver scheduling problem
- On-line \(k\)-truck problem and its competitive algorithms.
- On the On-Line k-Truck Problem with Benefit Maximization
- Competitive analysis for the on-line truck transportation problem
- Title not available (Why is that?)
- On the On-Line Weighted k-Taxi Problem
This page was built for publication: ON THE k-TRUCK SCHEDULING PROBLEM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696969)
