A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
- 31 May 2011
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 38 (5), 876-888
- https://doi.org/10.1016/j.cor.2010.08.012
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardinessComputers & Operations Research, 2010
- Conflict-free scheduling and routing of automated guided vehicles in mesh topologiesRobotics and Autonomous Systems, 2009
- A Decomposition Method for the Simultaneous Planning and Scheduling of Single-Stage Continuous Multiproduct PlantsIndustrial & Engineering Chemistry Research, 2005
- Decomposition and Dynamic Cut Generation in Integer Linear ProgrammingMathematical Programming, 2005
- Simultaneous job input sequencing and vehicle dispatching in a single-vehicle automated guided vehicle system: a heuristic branch-and-bound approach coupled with a discrete events simulation modelInternational Journal of Production Research, 2005
- Coloured timed Petri net model for real-time control of automated guided vehicle systemsInternational Journal of Production Research, 2004
- Intelligent agent framework to determine the optimal conflict-free path for an automated guided vehicles systemInternational Journal of Production Research, 2002
- Evaluation of alternate routing policies in scheduling a job-shop type FMSComputers & Industrial Engineering, 1997
- Design and operational control of an AGV systemInternational Journal of Production Economics, 1995
- Conflict-free shortest-time bidirectional AGV routeingInternational Journal of Production Research, 1991