Immediate schedule adjustment and semidefinite relaxation

DOI10.3934/JIMO.2018062MaRDI QIDQ2313755zbMATH OpenOpenAlexWikidataFDO

Authors Jinling Zhao, Wei Chen, Su Zhang

Publication date 23 July 2019

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2018062

zbMATH Keywords

immediateresource-constrainedschedule adjustmentsemidefinite relaxation

Mathematics Subject Classification ID

Operations research and management science (90B99) Applications of mathematical programming (90C90)

Recommendations

• Semi-definite relaxation algorithm for single machine scheduling with controllable processing times
• scientific article; zbMATH DE number 2166873
• Semidefinite relaxations of dynamical programs under discrete constraints
• Semidefinite programming relaxations for the quadratic assignment problem
• A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access

Cites work

• A survey of variants and extensions of the resource-constrained project scheduling problem
• Duality gap estimation of linear equality constrained binary quadratic programming
• GloptiPoly 3: moments, optimization and semidefinite programming
• scientific article; zbMATH DE number 4135692 (Why is no real title available?)
• scientific article; zbMATH DE number 4070633 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• On the gap between the quadratic integer programming problem and its semidefinite relaxation
• Recent advances in integer programming
• Scheduling and constraint propagation
• Scheduling subject to resource constraints: Classification and complexity
• Semidefinite Programming
• Semidefinite relaxations for integer programming
• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• The Schur complement and its applications
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Describes a project that uses

Uses Software

• GloptiPoly
• SeDuMi

This page was built for publication: Immediate schedule adjustment and semidefinite relaxation

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