Pages that link to "Item:Q5315986"
From MaRDI portal
The following pages link to SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES (Q5315986):
Displaying 3 items.
- A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (Q511074) (← links)
- Online scheduling on three uniform machines (Q765372) (← links)
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (Q862993) (← links)