VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS

DOI10.15807/jorsj.39.345zbMath0873.90051MaRDI QIDQ4345053

Toshihide Ibaraki, Hiroshi Nagamochi, Yoshiyuki Karuno

Publication date: 30 October 1997

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c072c8644aefaa33cecf75bab44ea112cefa358e

zbMATH Keywords

due date; processing time; maximum lateness; single-vehicle scheduling; tree-shaped road network

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

Related Items

Improved algorithms for joint optimization of facility locations and network connections, 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times., A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree, An approximability result of the multi-vehicle scheduling problem on a path with release and handling times, Linear time approximation schemes for vehicle scheduling problems, Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks, Robust identification for multi-section freeway traffic models