An algorithm for the solution of the two-route Johnson problem

DOI10.1007/BF01132086MaRDI QIDQ3033545zbMATH OpenFDO

Authors B. I. Dushin

Publication date 1988

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01132086

zbMATH Keywords

approximation algorithmm-machine flow-shop schedulingschedule length minimizationworst case accuracy bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Algorithms for 2-Route Cut Problems
• An approximation algorithm for the general routing problem
• Two Algorithmic Results for the Traveling Salesman Problem
• A Provably Good Algorithm for the Two Module Routing Problem
• An exact algorithm for the period routing problem
• An algorithm for solving the transportation problem
• An algorithm for the quickest path problem
• Algorithms for the Multi-constrained Routing Problem

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(7)

• Complexity, bounds and dynamic programming algorithms for single track train scheduling
• scientific article; zbMATH DE number 3871006 (Why is no real title available?)
• scientific article; zbMATH DE number 4137518 (Why is no real title available?)
• scientific article; zbMATH DE number 4170628 (Why is no real title available?)
• Algorithms for 2-Route Cut Problems
• scientific article; zbMATH DE number 3896632 (Why is no real title available?)
• scientific article; zbMATH DE number 919276 (Why is no real title available?)

This page was built for publication: An algorithm for the solution of the two-route Johnson problem

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