An LPT-bound for a parallel multiprocessor scheduling problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 8821
- A parallel approximation scheme for the multiprocessor scheduling problem
- scientific article; zbMATH DE number 1150234
- Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
- Parametric bounds for LPT scheduling on uniform processors
- scientific article; zbMATH DE number 1979517
- Performance of the LPT algorithm in multiprocessor scheduling
- scientific article; zbMATH DE number 1234733
Cited in
(13)- A parallel approximation scheme for the multiprocessor scheduling problem
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
- A note on the Coffman-Sethi bound for LPT scheduling
- Minimizing labor requirements in a periodic vehicle loading problem
- ILP formulations for scheduling ordered tasks on a bounded number of processors
- Parallel cooperative approaches for the labor constrained scheduling problem
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
- scientific article; zbMATH DE number 5964914 (Why is no real title available?)
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- Lower bound algorithms for multiprocessor task scheduling with ready times
- scientific article; zbMATH DE number 4092792 (Why is no real title available?)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
This page was built for publication: An LPT-bound for a parallel multiprocessor scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910052)
