Pages that link to "Item:Q2151369"
From MaRDI portal
The following pages link to Semi-online early work maximization problem on two hierarchical machines with partial information of processing time (Q2151369):
Displaying 3 items.
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
- Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time (Q6084675) (← links)
- A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times (Q6535284) (← links)
