An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection

DOI10.1016/j.ins.2023.119949zbMath1530.90044MaRDI QIDQ6179985

Hongyan Sang, Jiazhen Zou, Leilei Meng, Wenqiang Zou, Quan-ke Pan

Publication date: 18 January 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

schedulingiterated greedy algorithmautomated guided vehiclesafety detectionunloading setup time

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Warehousing in the e-commerce era: a survey
• A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
• Joint production and transportation scheduling in flexible manufacturing systems
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem

This page was built for publication: An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection