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

DOI10.1007/BF01132086zbMath0691.90039MaRDI QIDQ3033545

B. I. Dushin

Publication date: 1988

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmschedule length minimizationm-machine flow-shop schedulingworst case accuracy bound

Mathematics Subject Classification ID

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

Related Items (1)

Complexity, bounds and dynamic programming algorithms for single track train scheduling

Cites Work

• The Complexity of Flowshop and Jobshop Scheduling
• Unnamed Item

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