A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
From MaRDI portal
Publication:4697307
DOI10.1137/0803002zbMath0794.90039OpenAlexW1964651230MaRDI QIDQ4697307
Norbert Ascheuer, Martin Grötschel, Mechthild Stoer, Laureano Fernando Escudero Bueno
Publication date: 29 June 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0803002
traveling salesmanprecedence constraintsbranch-and-cut algorithmsfeasible minimum cost Hamiltonian path
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items (13)
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ A sequential ordering problem in automotive paint shops ⋮ Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem ⋮ Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ On due-date based valid cuts for the sequential ordering problem ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ Coupling ant colony systems with strong local searches ⋮ A hybrid particle swarm optimization approach for the sequential ordering problem ⋮ Tight lower bounds for the traveling salesman problem with draft limits ⋮ A heuristic manipulation technique for the sequential ordering problem ⋮ A polyhedral study of the asymmetric traveling salesman problem with time windows ⋮ Local search procedures for improving feasible solutions to the sequential ordering problem
This page was built for publication: A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
