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

DOI10.1080/02331938908843435zbMath0713.05030OpenAlexW2078699497MaRDI QIDQ3197848

Ondřej Čepek, Miron Tegze

Publication date: 1989

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

complexityNP-completenessacyclic directed graphone machine schedulingAcyclic Subdivision ProblemRestricted Robot Sequencing ProblemRobot Sequencing Problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• The robot sequencing problem: polynomial algorithm and complexity

This page was built for publication: Minimizing the number of grab's changes in a single machine scheduling problem