Adaptive path planning: algorithm and analysis
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 721-728
- https://doi.org/10.1109/robot.1995.525369
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The facet ascending algorithm for integer programming problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling of manufacturing systems using the Lagrangian relaxation techniqueIEEE Transactions on Automatic Control, 1993
- A practical approach to job-shop scheduling problemsIEEE Transactions on Robotics and Automation, 1993
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due DateOperations Research, 1991
- Schedule generation and reconfiguration for parallel machinesIEEE Transactions on Robotics and Automation, 1990
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- Dynamic programming and decomposition approaches for the single machine total tardiness problemEuropean Journal of Operational Research, 1987
- A Branch and Bound Algorithm for the Total Weighted Tardiness ProblemOperations Research, 1985
- Job-Shop Scheduling by Implicit EnumerationManagement Science, 1977
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part IOperations Research, 1973