A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles

DOI10.1016/j.cor.2010.08.012zbMath1202.90142OpenAlexW2044456402MaRDI QIDQ614066

Yuichiro Hiranaka, Ignacio E. Grossmann, Tatsushi Nishi

Publication date: 23 December 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.08.012

zbMATH Keywords

Lagrangian relaxationschedulingroutingautomated guided vehiclebilevel decomposition

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Managing Product Transitions: A Bilevel Programming Approach ⋮ Scheduling a single vehicle in the just-in-time part supply for a mixed-model assembly line ⋮ Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers ⋮ Quantum ant colony optimization algorithm for AGVs path planning based on Bloch coordinates of pheromones ⋮ A Multi-Fidelity Model Approach for Simultaneous Scheduling of Machines and Vehicles in Flexible Manufacturing Systems ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda ⋮ Two-level decomposition algorithm for crew rostering problems with fair working condition

Uses Software

• DIP

Cites Work

• Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
• Scheduling and routing of automated guided vehicles: A hybrid approach
• Vehicle scheduling in two-cycle flexible manufacturing systems
• A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles
• Design and operational issues in AGV-served manufacturing systems
• Logic-based Benders decomposition
• Partitioning procedures for solving mixed-variables programming problems. Reprint
• Integrated production and material handling scheduling using mathematical programming and constraint programming
• Decomposition and dynamic cut generation in integer linear programming
• Survey of research in the design and control of automated guided vehicle systems
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Coloured timed Petri net model for real-time control of automated guided vehicle systems
• Conflict-free shortest-time bidirectional AGV routeing
• Planning and Scheduling by Logic-Based Benders Decomposition
• 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 model
• Intelligent agent framework to determine the optimal conflict-free path for an automated guided vehicles system
• A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS

This page was built for publication: A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles