Pages that link to "Item:Q675305"
From MaRDI portal
The following pages link to Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305):
Displaying 12 items.
- MP or not MP: that is the question (Q283264) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date (Q1926635) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (Q3980518) (← links)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems (Q4286574) (← links)
- Parallel machine scheduling with high multiplicity (Q5930732) (← links)
