Periodic event scheduling for automated production systems
From MaRDI portal
(Redirected from Publication:5086025)
Recommendations
- How to minimize cycle times of robot manufacturing systems
- Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
- Cyclic scheduling in a robotic production line
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
- Minimizing the number of robots to meet a given cyclic schedule
Cites work
- A Flow Algorithm for Network Synchronization
- A Mathematical Model for Periodic Scheduling Problems
- A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- How to minimize cycle times of robot manufacturing systems
- scientific article; zbMATH DE number 2042677 (Why is no real title available?)
- scientific article; zbMATH DE number 6108474 (Why is no real title available?)
- Integral cycle bases for cyclic timetabling
- Optimizing over the first Chvátal closure
- Periodic network optimization with different arc frequencies
- Reducibility among combinatorial problems
- Separation of cycle inequalities in periodic timetabling
- The second Chvátal closure can yield better railway timetables
This page was built for publication: Periodic event scheduling for automated production systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086025)
