A heuristic manipulation technique for the sequential ordering problem-Reference-Cited by-同舟云学术

A heuristic manipulation technique for the sequential ordering problem

Published:2008-12 Issue:12 Volume:35 Page:3931-3944
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Montemanni R.,Smith D.H.,Gambardella L.M.

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference16 articles.

1. An inexact algorithm for the sequential ordering problem;Escudero;European Journal of Operational Research,1988

2. A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem;Seo,2003

3. Pullyblank W, Timlin M. Precedence constrained routing and helicopter scheduling: heuristic design. Technical Report RC17154 (#76032), IBM T.J. Watson Research Center; 1991.

4. An efficient implementation of local search algorithms for constrained routing problems;Savelsbergh;European Journal of Operational Research,1990

5. Ascheuer N. Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. PhD thesis, Technische Universität Berlin; 1995.

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Combining a Parallel Branch-and-Bound Algorithm with a Strong Heuristic to Solve the Sequential Ordering Problem;Proceedings of the 52nd International Conference on Parallel Processing Workshops;2023-08-07

2. A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem;Computers & Operations Research;2023-08

3. Precedence-Constrained arborescences;European Journal of Operational Research;2023-06

4. Compact Models for the Precedence-Constrained Minimum-Cost Arborescence Problem;Advances in Transdisciplinary Engineering;2023-03-30

5. A parallel branch-and-bound algorithm with history-based domination and its application to the sequential ordering problem;Journal of Parallel and Distributed Computing;2023-02