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

zbMATH Open0417.68023MaRDI QIDQ755294FDOQ755294

Authors: Mark Sh. Levin, Eugene Levner 

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)

Cited In (2)

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

This page was built for publication: An effective solution of the Bellman-Johnson problem on a tree-like network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q755294)