Pages that link to "Item:Q1306569"

The following pages link to On-line scheduling on a single machine: Minimizing the total completion time (Q1306569):

Displaying 11 items.

• Online interval scheduling on a single machine with finite lookahead (Q339562) (← links)
• Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine'' (Q625659) (← links)
• Optimally competitive list batching (Q837154) (← links)
• Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine (Q1402544) (← links)
• Ordinal on-line scheduling for maximizing the minimum machine completion time (Q1598882) (← links)
• Online scheduling on a single machine with grouped processing times (Q1723520) (← links)
• A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
• Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
• Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
• (Q4411418) (← links)
• (Q4828982) (← links)