A distributed exact algorithm for the multiple resource constrained sequencing problem
DOI10.1007/BF02023171zbMATH Open0779.90044MaRDI QIDQ2368093FDOQ2368093
Authors: Gautham K. Kudva, Joseph F. Pekny
Publication date: 23 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
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
sequencingtraveling salesmancutting planeprocess schedulingexact parallel branch and bound algorithm
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)
Cites Work
- Title not available (Why is that?)
- The prize collecting traveling salesman problem
- Title not available (Why is that?)
- Solving Large-Scale Zero-One Linear Programming Problems
- Title not available (Why is that?)
- Facets of the knapsack polytope
- Resource constrained assignment problems
- Title not available (Why is that?)
- Multi-Terminal Network Flows
- An efficient algorithm for the minimum capacity cut problem
- A parallel shortest augmenting path algorithm for the assignment problem
- Title not available (Why is that?)
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
Cited In (2)
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)