The inverse parallel machine scheduling problem with minimum total completion time

DOI10.3934/JIMO.2014.10.613zbMath1276.90027OpenAlexW2327172372MaRDI QIDQ380601

Hongtruong Pham, Xi-wen Lu

Publication date: 14 November 2013

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

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

zbMATH Keywords

schedulingparallel machineinverseprocessing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• Inverse scheduling: Two-machine flow-shop problem
• Inverse minimum cost flow problems under the weighted Hamming distance
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Inverse scheduling with maximum lateness objective
• A further study on inverse linear programming problems
• Inverse combinatorial optimization: a survey on problems, methods, and results
• On convergence of augmented Lagrangian method for inverse semi-definite quadratic programming problems
• Inverse maximum flow problems under the weighted Hamming distance
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Inverse Optimization
• Inverse maximum flow and minimum cut problems
• Nonlinear Programming
• Computing and Combinatorics

This page was built for publication: The inverse parallel machine scheduling problem with minimum total completion time