Immediate schedule adjustment and semidefinite relaxation

DOI10.3934/jimo.2018062zbMath1438.90413OpenAlexW2801914104WikidataQ129721462 ScholiaQ129721462MaRDI QIDQ2313755

Jin-Ling 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

semidefinite relaxationresource-constrainedimmediateschedule adjustment

Mathematics Subject Classification ID

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

Uses Software

• SeDuMi
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
• Scheduling and constraint propagation
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Scheduling subject to resource constraints: Classification and complexity
• The Schur complement and its applications
• On the gap between the quadratic integer programming problem and its semidefinite relaxation
• Lectures on Modern Convex Optimization
• Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
• GloptiPoly 3: moments, optimization and semidefinite programming
• Semidefinite Relaxations for Integer Programming
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Semidefinite Programming
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

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