Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
From MaRDI portal
(Redirected from Publication:675305)
Recommendations
- Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
- Solving large quadratic assignment problems in parallel
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem
- scientific article; zbMATH DE number 724213
- Parallel machine scheduling with high multiplicity
- scientific article; zbMATH DE number 4164535
- scientific article; zbMATH DE number 1424212
- Parallel computing in bound constrained quadratic programming
Cites work
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- An O(EV\log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An O(n) algorithm for quadratic knapsack problems
- Convex separable optimization is not much harder than linear optimization
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- On polynomial solvability of the high multiplicity total weighted tardiness problem
- Scheduling independent tasks to reduce mean finishing time
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
Cited in
(12)- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Quadratic M-convex and L-convex functions
- On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date
- MP or not MP: that is the question
- Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Parallel machine scheduling with high multiplicity
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem
This page was built for publication: Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675305)
