Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times

DOI10.1080/10020070412331344281MaRDI QIDQ2583362zbMATH OpenOpenAlexFDO

Authors Feng Zhang, Feng Chen, Guochun Tang

Publication date 16 January 2006

Published in Progress in Natural Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10020070412331344281

zbMATH Keywords

approximation algorithmrelease time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Convex quadratic and semidefinite programming relaxations in scheduling
• scientific article; zbMATH DE number 1405788
• 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
• scientific article; zbMATH DE number 1405788 (Why is no real title available?)
• 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)