Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization

DOI10.1007/978-3-031-35173-0_10MaRDI QIDQ6619608

Wojciech Bożejko, Radosław Idzikowski, Jarosław Rudy, Czesław Smutnicki

Publication date: 16 October 2024

zbMATH Keywords

Lagrangian relaxationmetaheuristicslower boundtotal weighted tardiness

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
• An alternative framework to Lagrangian relaxation approach for job shop scheduling.
• Lagrangian relaxation for SVM feature selection
• Lagrangian relaxation and constraint generation for allocation and advanced scheduling
• Convergence of the surrogate Lagrangian relaxation method
• A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
• A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
• A dual algorithm for the one-machine scheduling problem
• Validation of subgradient optimization
• Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty

This page was built for publication: Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization