An inexact algorithm for the sequential ordering problem
From MaRDI portal
Publication:1108187
DOI10.1016/0377-2217(88)90333-5zbMath0653.90036OpenAlexW2018474648MaRDI 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
heuristicsmanufacturingsequencingdirected acyclic graphAssignment ProblemAsymmetric Traveling Salesman Problemprecedence relationshipsSequential Ordering Problem
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints ⋮ A sequential ordering problem in automotive paint shops ⋮ A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships ⋮ Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem ⋮ A branch-and-cut algorithm for the preemptive swapping problem ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ An improved ant colony system for the sequential ordering problem ⋮ An inexact algorithm for the sequential ordering problem ⋮ Paint batching problem on \(M\)-to-1 conveyor systems ⋮ On due-date based valid cuts for the sequential ordering problem ⋮ A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ Exact algorithms for the multi-pickup and delivery problem with time windows ⋮ Coupling ant colony systems with strong local searches ⋮ Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ A hybrid particle swarm optimization approach for the sequential ordering problem ⋮ Precedence-constrained arborescences ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm ⋮ A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ A production planning problem in FMS ⋮ A heuristic manipulation technique for the sequential ordering problem ⋮ The multi-pickup and delivery problem with time windows ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse ⋮ Strong cuts from compatibility relations for the dial-a-ride problem ⋮ Local search procedures for improving feasible solutions to the sequential ordering problem ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding ⋮ An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers ⋮ Parallelization strategies for rollout algorithms ⋮ Compact formulations of the Steiner traveling salesman problem and related problems
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
