Polynomial algorithms for MPSP using parametric linear programming
From MaRDI portal
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Recommendations
- A relation between multiprocessor scheduling and linear programming
- A polynomial algorithm for multiprocessor scheduling with two job lengths.
- General multiprocessor task scheduling: approximate solutions in linear time
- Multiprocessor scheduling under precedence constraints: polyhedral results
- A polynomial algorithm for some preemptive multiprocessor task scheduling problems
This page was built for publication: Polynomial algorithms for MPSP using parametric linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712371)