Local search procedures for improving feasible solutions to the sequential ordering problem

DOI10.1007/BF02024937zbMath0784.90035OpenAlexW2088398985MaRDI QIDQ1309885

Anna Sciomachen, Laureano Fernando Escudero Bueno

Publication date: 21 March 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02024937

zbMATH Keywords

approximation algorithmmakespanHamiltonian pathrelease datesequential ordering problemdeadlineprecedence relationships

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

On due-date based valid cuts for the sequential ordering problem ⋮ The multi-pickup and delivery problem with time windows

Cites Work

• Unnamed Item
• The perfectly matchable subgraph polytope of an arbitrary graph
• Single facility multi-class job scheduling
• An inexact algorithm for the sequential ordering problem
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Local Search for the Asymmetric Traveling Salesman Problem
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Complexity of Scheduling under Precedence Constraints
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)

This page was built for publication: Local search procedures for improving feasible solutions to the sequential ordering problem