Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems

DOI10.1016/S0166-218X(98)00104-8zbMath0917.90199MaRDI QIDQ1283797

Marco Trubian, Giovanni Righini

Publication date: 17 August 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

sequencingworst-case performancedata-dependent boundsminimum cost cyclemixed graph with oriented arcsStacker-Crane problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Uses Software

• Algorithm 97

Cites Work

• A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem

This page was built for publication: Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems