The robot sequencing problem: polynomial algorithm and complexity

DOI10.1080/02331938508843054MaRDI QIDQ3713849zbMATH OpenOpenAlexFDO

Authors

Publication date 1985

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

directed graphsNP-hardpolynomial-time algorithmprecedence constraintssequencing robot activitiesspecial casevertex packing problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3943539
• Algorithms for sequencing robot activities in a robot-centered parallel- processor workcell
• Minimizing the number of grab's changes in a single machine scheduling problem
• A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
• scientific article; zbMATH DE number 4055357

Cites work

• Computational Complexity of Discrete Optimization Problems

Cited in

(5)

• Algorithms for sequencing robot activities in a robot-centered parallel- processor workcell
• Minimizing the number of grab's changes in a single machine scheduling problem
• scientific article; zbMATH DE number 3943539 (Why is no real title available?)
• scientific article; zbMATH DE number 3987032 (Why is no real title available?)
• A faster polynomial algorithm for 2-cyclic robotic scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713849)