Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times
From MaRDI portal
Publication:2583362
Recommendations
- Convex quadratic and semidefinite programming relaxations in scheduling
- Convex quadratic programming relaxations for network scheduling problems
- Scheduling with rejection
- Convex programming for scheduling unrelated parallel machines
- Semi-definite relaxation algorithm for single machine scheduling with controllable processing times
Cited in
(5)- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Semi-definite relaxation algorithm for single machine scheduling with controllable processing times
- Convex quadratic and semidefinite programming relaxations in scheduling
- Convex quadratic programming relaxations for network scheduling problems
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
This page was built for publication: Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583362)