Generalized assignment with nonlinear capacity interaction

Article Abstract:

A variation of the generalized assignment problem called the 0-1 generalized assignment problem with nonlinear capacity constraints (NLGAP) is developed to allow for capacity interaction among tasks assigned to the same agent. A branch-and-bound algorithm and a heuristic for obtaining approximate solutions to NLGAP are also developed. Results indicate that the branch-and-bound algorithm can solve NLGAPs with five agents, 20 tasks, and over 1000 nonlinear terms per constraint. Results also indicate that the heuristic can develop near-optimal solutions.

---

Multiple shift workforce lower bounds

Article Abstract:

Lower bounds on workforce size did not incorporate the effect of constraints on the changing of shifts for multiple shift worker scheduling problems in past research. New lower bounds for workforce size are described, utilizing a network model of the problem to model its multiple shift characteristic. Multiple shift lower bounds degenerate into the single shift lower bounds for some cases of demands. Lower bounds can be calculated by hand for some cases of constraints.

Operations research, Human resource planning, Line and staff organization

---

Selection and design of heuristic procedures for solving roll trim problems

Article Abstract:

Research has been conducted on design and selection of heuristic procedures for solving one-dimensional, well-defined, combinatorial roll trim problems that are too large to optimize. Five different roll trim problems and the heuristic procedures are discussed. The development of 'industrial-grade' heuristic problem solving procedures is analyzed.

Similar abstracts:

• Abstracts: Optimal power-of-two replenishment strategies in capacitated general production/distribution networks. M-G-c queueing systems with multiple customer classes: characterization and control of achievable performance under nonpreemptive priority rules
• Abstracts: Heuristics with constant error guarantees for the design of tree networks
• Abstracts: Heuristics with constant error guarantees for the design of tree networks. part 2 Algorithms for the multi-resource generalized assignment problem
• Abstracts: Finding embedded network rows in linear programs I. extraction heuristics. A modeling language for mathematical programming
• Abstracts: Applying cost accounting to factory automation. Changing performance measures at Caterpillar. Accountants overseas

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