Performance Measures and Schedules in Periodic Job Shops
From MaRDI portal
(Redirected from Publication:4367266)
Recommendations
Cited in
(22)- Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions
- Cyclic robot scheduling for 3D printer-based flexible assembly systems
- Cyclic Schedules for Job Shops with Identical Jobs
- Steady state analysis of timed event graphs with time window constraints
- On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
- Cyclic scheduling in a robotic production line
- Tabu search algorithms for cyclic machine scheduling problems
- A parametric critical path problem and an application for cyclic scheduling
- Scheduling a wet station for wafer cleaning with multiple job flows and multiple wafer-handling robots
- A branch and bound algorithm for the cyclic job-shop problem with transportation
- Cyclic scheduling in robotic flowshops with bounded work-in-process levels
- A general model for cyclic machine scheduling problems
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
- Throughput-optimal sequences for cyclically operated plants
- A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times
- Vehicle minimization for periodic deliveries
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
- On scheduling cycle shops: Classification, complexity and approximation
- Cyclic hoist scheduling in large real-life electroplating lines
- The complexity of cyclic shop scheduling problems
- Some complexity results in cyclic scheduling
- An algorithm for the maximum revenue jobshop problem
This page was built for publication: Performance Measures and Schedules in Periodic Job Shops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367266)
