Heuristic optimization of sequence of customer orders

DOI10.1016/J.AMC.2004.03.008MaRDI QIDQ1765868zbMATH OpenOpenAlexFDO

Authors P. P. Ossipov

Publication date 23 February 2005

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2004.03.008

zbMATH Keywords

heuristiclogistic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• Optimal sequencing of orders in the cases of the single and multiple working-places
• On the sequential ordering problems
• Order batching heuristic seed algorithm based on compound similarity of orders
• Tailoring customer order scheduling search algorithms
• scientific article; zbMATH DE number 1538846

Cited in

(4)

• Genetic algorithms in supply chain management: a critical analysis of the literature
• Optimal sequencing of orders in the cases of the single and multiple working-places
• Simple heuristic algorithm for profile reduction of arbitrary sparse matrix
• A learning-based two-stage optimization method for customer order scheduling

This page was built for publication: Heuristic optimization of sequence of customer orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765868)