An inexact algorithm for the sequential ordering problem

DOI10.1016/0377-2217(88)90333-5zbMath0653.90036MaRDI QIDQ1108187

Laureano Fernando Escudero Bueno

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90333-5

zbMATH Keywords

heuristics; manufacturing; sequencing; directed acyclic graph; Assignment Problem; Asymmetric Traveling Salesman Problem; precedence relationships; Sequential Ordering Problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

Related Items

A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem, A hybrid particle swarm optimization approach for the sequential ordering problem, Parallelization strategies for rollout algorithms, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, A production planning problem in FMS, A heuristic manipulation technique for the sequential ordering problem, An inexact algorithm for the sequential ordering problem, Local search procedures for improving feasible solutions to the sequential ordering problem, A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships, On due-date based valid cuts for the sequential ordering problem, Coupling ant colony systems with strong local searches, A branch-and-cut algorithm for the preemptive swapping problem, A sequential ordering problem in automotive paint shops

Cites Work

• Unnamed Item
• Unnamed Item
• An inexact algorithm for the sequential ordering problem
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Facets of the linear ordering polytope
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• Local Search for the Asymmetric Traveling Salesman Problem
• A restricted Lagrangean approach to the traveling salesman problem
• Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph