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

DOI10.1080/02331938908843435MaRDI QIDQ3197848zbMATH OpenOpenAlexFDO

Authors Miron Tegze, Ondřej Čepek

Publication date 1989

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

acyclic directed graphAcyclic Subdivision ProblemcomplexityNP-completenessone machine schedulingRestricted Robot Sequencing ProblemRobot Sequencing Problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3943539
• The robot sequencing problem: polynomial algorithm and complexity
• Scheduling with few changes
• Single Machine Scheduling with Series-Parallel Precedence Constraints
• Scheduling in reentrant robotic cells: algorithms and complexity

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The robot sequencing problem: polynomial algorithm and complexity

Cited in

(3)

• Minimizing the number of machines for minimum length schedules
• The robot sequencing problem: polynomial algorithm and complexity
• scientific article; zbMATH DE number 3943539 (Why is no real title available?)

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

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