A convoy scheduling problem

DOI10.1016/0166-218X(91)90009-LzbMath0734.90038OpenAlexW2071308851WikidataQ127564939 ScholiaQ127564939MaRDI QIDQ811336

N. E. Zubov

Publication date: 1991

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90009-l

zbMATH Keywords

tabu searchtask schedulingtime-windowstotal time needed

Mathematics Subject Classification ID

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

Related Items

Genetic algorithms and tabu search: Hybrids for optimization, The tabu search metaheuristic: How we used it, Metaheuristics: A bibliography, Computational complexity of convoy movement planning problems

Cites Work

• Future paths for integer programming and links to artificial intelligence
• Tabu Search—Part I
• Unnamed Item
• Unnamed Item