Pages that link to "Item:Q1317008"

The following pages link to Minimizing the fleet size with dependent time-window and single-track constraints (Q1317008):

Displaying 8 items.

• A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell (Q632670) (← links)
• A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints (Q693472) (← links)
• Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm (Q955949) (← links)
• Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots (Q1042101) (← links)
• Determining the optimal starting times in a cyclic schedule with a given route (Q1310046) (← links)
• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints (Q1341993) (← links)
• An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times (Q2466598) (← links)
• Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach (Q4671265) (← links)