The following pages link to (Q3971305):
Displayed 5 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)
- 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)