A survey of algorithms for the generalized assignment problem

Article Abstract:

At least four well-balanced ingredients are required of effective models for solving general assignment problems (GAP). These are a primal heuristic, a bounding scheme, a variable-fixing procedure and a branching rule. GAPs are calculations intended to find the least cost involved in the assignment of jobs to agents so that each job is delegated exactly once, considering capacity restraints. A survey of algorithms for the GAP indicate, however, a dearth of representative sets of test problems for comparative analysis as well as a general lack of effective heuristics.

Analysis, Surveys, Algorithms, Combinatorial optimization, Optimization theory, Mathematical programming

---

The capacitated distribution and waste disposal problem

Article Abstract:

Lower bounding procedures and upper bounding heuristics are shown to be effective in the capacitated distribution and waste disposal problem when these are embedded in a standard branch and bound algorithm. The problem involves the simultaneous design of a distribution network with plants and waste disposal units (WDU) and the coordination of product flows and waste flows within the network to minimize fixed costs for opening plants and WDUs as well as the variable costs related to product and waste flows.

Refuse systems, Solid Waste Disposal, Waste Treatment and Disposal, Methods, Models, Management, Network analysis (Planning), Evaluation, Waste disposal sites, Heuristic programming, Branch and bound algorithms

---

Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows

Article Abstract:

An exact solution method for the Discrete Lotsizing and Scheduling Problem (DLSPSD) with sequence dependent set-up times and set-up costs is developed, based on the conversion of DLSPSD into a Travelling Salesman Problem with Time Windows. It was established that the method is the first algorithm able to solve moderate DLSPD problems well with a moderate computational effort.

Work Schedules, Production Planning & Control, Research, Usage, Work hours, Production control, Dynamic programming, Economic lot size

Similar abstracts:

• Abstracts: A necessary marriage: the case for the U.S.-Canadian trade agreement. Instant international: strategic reality for small high-technology firms in Canada
• Abstracts: A note on efficient solutions for the linear bilevel programming problem. Investment and harvest strategies of the Finnish forest sector under different forest-tax policies: a differential game approach with computer-based decision aid
• Abstracts: Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem. Inventory models with inventory-level-dependent demand: a comprehensive review and unifying theory
• Abstracts: Enhancing an algorithm for set covering problems. A tree search algorithm for the crew scheduling problem. A heuristic for Euclidean and rectilinear Steiner problems
• Abstracts: A review of stochastic modelling of delay and capacity at unsignalized priority intersections. On the single machine total tardiness problem

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