Lagrangean/surrogate relaxation for generalized assignment problems

Article Abstract:

A study was conducted to analyze Lagrangean/surrogate relaxation to the problem of maximum profit assignment of tasks to agents wherein each task is assigned to only one agent with capacity constraints. The Lagrangean/surrogate was evaluated against the conventional Lagrangean relaxation using a computational study supporting a large set of instances. Relaxation multipliers were then utilized with efficient constructive heuristics to determine feasible solutions.

Management Dynamics NEC, Research, Scheduling (Management), Management techniques, Relaxation methods (Mathematics)

---

Capacitated lot-sizing and scheduling by Lagrangean relaxation

Article Abstract:

Several optimal/near-optimal procedures are presented to solve capacitated lot-sizing and scheduling problems in production planning. The Lagrangean relaxation method is used to formulate approaches in set-up times, limited regular time and limited overtime. Implementation of these approaches is claimed to result in lower production costs by reducing inventories, the number of setups and labor costs.

Integer programming, Numerical analysis, Economic lot size

---

Similar abstracts:

• Abstracts: A Lagrangean Relaxation Heuristic for Vehicular Routing. Stochastic Processes and their Network Representations Associated with a Production Line Queuing Model
• Abstracts: Hierarchical Location-Allocation Problems: A Classification Scheme

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.