Local search procedures for improving feasible solutions to the sequential ordering problem
type: Item
instance of: scholarly article
title: Local search procedures for improving feasible solutions to the sequential ordering problem
zbMATH Open document ID: 0784.90035
DOI: 10.1007/BF02024937
published in: Annals of Operations Research
publication date: 1994-03-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 474775
zbMATH Keywords: sequential ordering problem
zbMATH Keywords: Hamiltonian path
zbMATH Keywords: release date
zbMATH Keywords: deadline
zbMATH Keywords: precedence relationships
zbMATH Keywords: makespan
zbMATH Keywords: approximation algorithm
author: Laureano F. Escudero Bueno
author: Anna Sciomachen
MaRDI profile type: Publication
cites work: Single facility multi-class job scheduling
cites work: A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: The perfectly matchable subgraph polytope of an arbitrary graph
cites work: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
cites work: An inexact algorithm for the sequential ordering problem
cites work: Q3938812
cites work: Local Search for the Asymmetric Traveling Salesman Problem
cites work: Complexity of Scheduling under Precedence Constraints
cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
cites work: Single-Machine Scheduling Polyhedra with Precedence Constraints
full work available at URL: https://doi.org/10.1007/bf02024937
OpenAlex ID: W2088398985
description: scientific article; zbMATH DE number 474775