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

DOI10.1007/BF02024937zbMath0784.90035MaRDI QIDQ1309885

Laureano Fernando Escudero Bueno, Anna Sciomachen

Publication date: 21 March 1994

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

zbMATH Keywords

approximation algorithm; makespan; Hamiltonian path; release date; sequential ordering problem; deadline; precedence relationships

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B35: Deterministic scheduling theory in operations research

Related Items

On due-date based valid cuts for the sequential ordering problem

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)