The inverse parallel machine scheduling problem with minimum total completion time
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- A further study on inverse linear programming problems
- A numerically stable dual method for solving strictly convex quadratic programs
- Computing and Combinatorics
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- Inverse Optimization
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse maximum flow and minimum cut problems
- Inverse maximum flow problems under the weighted Hamming distance
- Inverse minimum cost flow problems under the weighted Hamming distance
- Inverse scheduling with maximum lateness objective
- Inverse scheduling: Two-machine flow-shop problem
- Nonlinear Programming
- On convergence of augmented Lagrangian method for inverse semi-definite quadratic programming problems
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
Cited in
(2)
This page was built for publication: The inverse parallel machine scheduling problem with minimum total completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q380601)
