Pages that link to "Item:Q906560"

The following pages link to Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560):

Displaying 13 items.

• Scheduling of coupled tasks and one-machine no-wait robotic cells (Q954024) (← links)
• A note on scheduling identical coupled tasks in logarithmic time (Q968178) (← links)
• An exact algorithm for scheduling identical coupled tasks (Q1762669) (← links)
• Coupled task scheduling with time-dependent processing times (Q2061140) (← links)
• Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
• Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
• Minimizing the waiting time for a one-way shuttle service (Q2305017) (← links)
• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
• Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (Q2883631) (← links)
• (Q4866315) (← links)
• New algorithms for coupled tasks scheduling – a survey (Q4917224) (← links)
• A binary search algorithm for the general coupled task scheduling problem (Q6057721) (← links)
• The coupled task scheduling problem: an improved mathematical program and a new solution algorithm (Q6195035) (← links)