Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
From MaRDI portal
Publication:675305
DOI10.1007/BF02522821zbMATH Open0865.68008OpenAlexW2075392870MaRDI QIDQ675305FDOQ675305
Authors: Juan-Miguel Gracia 
Publication date: 30 June 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02522821
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
- scientific article; zbMATH DE number 1424212
- Parallel computing in bound constrained quadratic programming
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Title not available (Why is that?)
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Scheduling independent tasks to reduce mean finishing time
- 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
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- On polynomial solvability of the high multiplicity total weighted tardiness problem
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
Cited In (9)
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem
- Quadratic M-convex and L-convex functions
- Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
- Parallel machine scheduling with high multiplicity
- 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
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
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)
