A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints

DOI10.1016/0377-2217(87)90139-1zbMath0618.90040OpenAlexW2027874349MaRDI QIDQ1089245

Giuseppe Paletta

Publication date: 1987

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90139-1

zbMATH Keywords

heuristicpolynomial timepseudo-cyclicwindow constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Management of periodic demands in distribution systems
• Optimal distribution strategies with cyclic demands
• On general routing problems
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints