Pages that link to "Item:Q4785695"

The following pages link to Scheduling Unrelated Machines by Randomized Rounding (Q4785695):

Displaying 9 items.

• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
• Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
• Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
• Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
• Scheduling maintenance jobs in networks (Q1628599) (← links)