A distributed exact algorithm for the multiple resource constrained sequencing problem

DOI10.1007/BF02023171MaRDI QIDQ2368093zbMATH OpenFDO

Authors Gautham K. Kudva, Joseph F. Pekny

Publication date 23 August 1993

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

sequencingtraveling salesmancutting planeprocess schedulingexact parallel branch and bound algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• scientific article; zbMATH DE number 5629900
• An architecture for solving sequencing and resource allocation problems using approximation methods
• scientific article; zbMATH DE number 2084748
• Near-optimal scheduling of distributed algorithms
• scientific article; zbMATH DE number 2088163
• Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems
• scientific article; zbMATH DE number 67289
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3989103 (Why is no real title available?)
• scientific article; zbMATH DE number 43711 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• A parallel shortest augmenting path algorithm for the assignment problem
• An efficient algorithm for the minimum capacity cut problem
• Facets of the knapsack polytope
• Multi-Terminal Network Flows
• Resource constrained assignment problems
• Solving Large-Scale Zero-One Linear Programming Problems
• The prize collecting traveling salesman problem

Cited in

(2)

• scientific article; zbMATH DE number 3991266 (Why is no real title available?)
• scientific article; zbMATH DE number 5629900 (Why is no real title available?)

This page was built for publication: A distributed exact algorithm for the multiple resource constrained sequencing problem

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