Relaxation heuristics for a generalized assignment problem

Article Abstract:

Relaxation heuristics are suggested for the problem of maximum profit assignment of n tasks to m agents (n > m), such that each task is given to only one agent depending on the capacity limitations. Lagrangian or surrogate relaxation are employed so that the heuristics can do a subgradient search obtaining feasible solutions. Relaxation multipliers are utilized with an enhanced heuristic of Martello and Toth or a new constructive heuristic to search for feasible solutions. Six heuristics are tested with problems of the literature and random generated problems.

Analysis, Usage, Production planning, Lagrangian functions, Heuristic programming, Relaxation methods (Mathematics)

---

Eliminating redundant columns in continuous tour scheduling problems

Article Abstract:

A method is derived which eliminates redundant columns (tours) from generalized set-covering formulations of continuous tour scheduling problems. These eliminated tours contain work shifts that either begin or conclude in planning intervals with zero labor requirements. Application of the method to 27 United Airlines Airport Stations showed that it eliminated at least 27% of total tours.

Management Theory & Techniques, Models, Management, Scheduling (Management), Optimization theory, Mathematical programming

---

Similar abstracts:

• Abstracts: Using the generalized assignment problem in scheduling the ROSAT space telescope. On stochastic machine scheduling with general distributional assumptions
• Abstracts: A heuristic for blocking flow algorithms. Heuristic and optimization approaches to extending the Kohonen self organizing algorithm
• Abstracts: Maurice Saatchi's House of Lords appointment draws flak. Dalgety challenges Mars petfood with Quaker purchase
• Abstracts: Stress relief at a glance. 15 scientifically proven ways to eliminate holiday stress
• Abstracts: New markets come of age. Floating around the West Midlands. Catering for enterprise? (equity markets)

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