Pages that link to "Item:Q3971305"

The following pages link to Scheduling of parallel processors: A posterior bound on LPT sequencing and a two-step algorithm (Q3971305):

Displaying 9 items.

• A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
• A general lower bound for the makespan problem (Q1266724) (← links)
• An LPT-bound for a parallel multiprocessor scheduling problem (Q1910052) (← links)
• A note on the Coffman-Sethi bound for LPT scheduling (Q2356126) (← links)
• A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)
• Heuristic scheduling of parallel machines with sequence-dependent set-up times (Q4443334) (← links)
• A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS (Q4650621) (← links)
• (Q4729335) (← links)
• (Q4791888) (← links)