Pages that link to "Item:Q1910052"
From MaRDI portal
The following pages link to An LPT-bound for a parallel multiprocessor scheduling problem (Q1910052):
Displaying 13 items.
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
- A parallel approximation scheme for the multiprocessor scheduling problem (Q1606878) (← links)
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis (Q1866998) (← links)
- A note on the Coffman-Sethi bound for LPT scheduling (Q2356126) (← links)
- Minimizing labor requirements in a periodic vehicle loading problem (Q2490369) (← links)
- ILP formulations for scheduling ordered tasks on a bounded number of processors (Q2741499) (← links)
- Parallel cooperative approaches for the labor constrained scheduling problem (Q2776558) (← links)
- (Q3095030) (← links)
- Tighter Bounds for the Multifit Processor Scheduling Algorithm (Q3326834) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
- (Q3820021) (← links)
- Bounds for the cardinality constrained \(P \|C_{max}\) problem (Q5939270) (← links)
