Pages that link to "Item:Q1391530"
From MaRDI portal
The following pages link to Using duplication for scheduling unitary tasks on m processors with unit communication delays (Q1391530):
Displaying 5 items.
- A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670) (← links)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
- (Q2741503) (← links)
- The robust cyclic job shop problem (Q6087479) (← links)
