Pages that link to "Item:Q358659"

The following pages link to 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):

Displaying 7 items.

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324) (← links)
• Online packing of arbitrary sized items into designated and multipurpose bins (Q2001455) (← links)
• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← links)
• Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
• On-line Scheduling with a Monotonous Subsequence Constraint (Q4632214) (← links)