Pages that link to "Item:Q1926488"

The following pages link to An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488):

Displaying 8 items.

• On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
• Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine'' (Q625659) (← links)
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (Q1617277) (← links)
• Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324) (← links)
• Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
• Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions (Q3391992) (← links)
• Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)