Pages that link to "Item:Q5931905"

The following pages link to Semi-on-line scheduling problems for maximizing the minimum machine completion time (Q5931905):

Displaying 9 items.

• Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (Q862993) (← links)
• Optimal semi-online algorithms for machine covering (Q870840) (← links)
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
• Preemptive semi-online algorithms for parallel machine scheduling with known total size (Q2508575) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs (Q3305474) (← links)
• A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs (Q5456312) (← links)
• Semi-on-line scheduling with ordinal data on two uniform machines (Q5945393) (← links)
• Parallel solutions for ordinal scheduling with a small number of machines (Q6176402) (← links)