An inexact algorithm for the sequential ordering problem

DOI10.1016/0377-2217(88)90333-5MaRDI QIDQ1108187zbMATH OpenOpenAlexFDO

Authors Laureano F. 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

heuristicsdirected acyclic graphmanufacturingsequencingAssignment ProblemAsymmetric Traveling Salesman Problemprecedence relationshipsSequential Ordering Problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Local search procedures for improving feasible solutions to the sequential ordering problem
• A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
• scientific article; zbMATH DE number 1538846
• On the sequential ordering problems
• scientific article; zbMATH DE number 2159167

Cites work

• scientific article; zbMATH DE number 3932819 (Why is no real title available?)
• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A restricted Lagrangean approach to the traveling salesman problem
• Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph
• An inexact algorithm for the sequential ordering problem
• Facets of the linear ordering polytope
• Local Search for the Asymmetric Traveling Salesman Problem
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem

Cited in

(41)

• Compact formulations of the Steiner traveling salesman problem and related problems
• scientific article; zbMATH DE number 4123514 (Why is no real title available?)
• scientific article; zbMATH DE number 1538846 (Why is no real title available?)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
• An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
• An inexact algorithm for the sequential ordering problem
• A sequential ordering problem in automotive paint shops
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
• Parallelization strategies for rollout algorithms
• scientific article; zbMATH DE number 4072711 (Why is no real title available?)
• scientific article; zbMATH DE number 4016556 (Why is no real title available?)
• The order of Appel's algorithm
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
• An improved ant colony system for the sequential ordering problem
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning
• Exact algorithms for the multi-pickup and delivery problem with time windows
• Sequential unreliable newsboy ordering policies
• Local search procedures for improving feasible solutions to the sequential ordering problem
• scientific article; zbMATH DE number 2159167 (Why is no real title available?)
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• Precedence-constrained arborescences
• The multi-pickup and delivery problem with time windows
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
• On the sequential ordering problems
• A heuristic manipulation technique for the sequential ordering problem
• Paint batching problem on M-to-1 conveyor systems
• Coupling ant colony systems with strong local searches
• Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
• A hybrid particle swarm optimization approach for the sequential ordering problem
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• Strong cuts from compatibility relations for the dial-a-ride problem
• A production planning problem in FMS
• A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
• scientific article; zbMATH DE number 3570344 (Why is no real title available?)
• On due-date based valid cuts for the sequential ordering problem
• A branch-and-cut algorithm for the preemptive swapping problem
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse

This page was built for publication: An inexact algorithm for the sequential ordering problem

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