The robot sequencing problem: polynomial algorithm and complexity

DOI10.1080/02331938508843054zbMath0586.90052OpenAlexW2029427333MaRDI QIDQ3713849

No author found.

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508843054

zbMATH Keywords

polynomial-time algorithmNP-harddirected graphsprecedence constraintsspecial casesequencing robot activitiesvertex packing problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Minimizing the number of grab's changes in a single machine scheduling problem

Cites Work

• Computational Complexity of Discrete Optimization Problems

This page was built for publication: The robot sequencing problem: polynomial algorithm and complexity