scientific article; zbMATH DE number 1405788

MaRDI QIDQ4938773zbMATH OpenFDO

Authors Martin Skutella

Publication date 25 October 2000

zbMATH Keywords

convex quadratic programming relaxationparallel processors or machinesscheduled

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Quadratic programming (90C20)

Recommendations

• Convex quadratic and semidefinite programming relaxations in scheduling
• Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times
• Convex programming for scheduling unrelated parallel machines
• Scheduling with rejection
• scientific article; zbMATH DE number 871909

Cited in

(6)

• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Designing PTASs for MIN-SUM scheduling problems
• Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times
• Convex quadratic and semidefinite programming relaxations in scheduling
• A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
• A conic quadratic formulation for a class of convex congestion functions in network flow problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938773)