Solving makespan minimization problems with Lagrangean decomposition
From MaRDI portal
Publication:1209146
DOI10.1016/0166-218X(93)90176-OzbMath0778.90026OpenAlexW2003015974MaRDI QIDQ1209146
Publication date: 16 May 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90176-o
parallel machinesmakespanmultiple job typesplant locationconstrained 0-1 knapsack problemsLagrangean dual boundsingle stage manufacturing process
Related Items
Lagrangean relaxation. (With comments and rejoinder)., Exact approaches for the knapsack problem with setups, Minmax combinatorial optimization, A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution, Exact and heuristic solution approaches for the mixed integer setup knapsack problem, An homage to Joseph-Louis Lagrange and Pierre Huard, Two-level decomposition algorithm for crew rostering problems with fair working condition, Heuristic scheduling of parallel machines with sequence-dependent set-up times, Some personal views on the current state and the future of locational analysis
Cites Work
