Pages that link to "Item:Q1382807"

The following pages link to A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling (Q1382807):

Displaying 14 items.

• Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance (Q337088) (← links)
• Cycle time analysis of dual-arm cluster tools for wafer fabrication processes with multiple wafer revisiting times (Q337294) (← links)
• Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance (Q342566) (← links)
• A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell (Q632670) (← links)
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach (Q856208) (← links)
• A faster polynomial algorithm for 2-cyclic robotic scheduling (Q880563) (← links)
• A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case (Q1003678) (← links)
• Cyclic scheduling in a robotic production line (Q1347600) (← links)
• On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
• A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line (Q1779707) (← links)
• A polynomial algorithm for 2-degree cyclic robot scheduling (Q1869423) (← links)
• Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants (Q2027040) (← links)
• Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions (Q2434294) (← links)
• Part sequencing in three-machine no-wait robotic cells (Q5929148) (← links)