An effective solution of the Bellman-Johnson problem on a tree-like network

zbMath0417.68023MaRDI QIDQ755294

Eugene Levner, Mark Sh. Levin

Publication date: 1978

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

computational complexityschedulingeffective algorithmBellman-Johnson problem on a tree-like networkcase of two machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Method for optimzing functionals of permutations in the presence of constraints ⋮ A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots