Article

An algorithm for the bottleneck generalized assignment problem

Fuqua School of Business, Duke University, Durham, NC 27706 USA
Computers & Operations Research (Impact Factor: 1.72). 05/1993; 20(4):355-362. DOI: 10.1016/0305-0548(93)90079-X
Source: dx.doi.org

ABSTRACT We discuss a bottleneck (or minimax) version of the generalized assignment problem, known as the task bottleneck generalized assignment problem (TBGAP). TBGAP involves the assignment of a number of jobs to a number of agents such that each job is performed by a unique agent, and capacity limitations on the agents are not exceeded. The objective is to minimize the maximum of the costs of the assignments that are made. We present an algorithm for solving TBGAP. The TBGAP algorithm is illustrated by an example and computational experience is reported. The algorithm is seen to be effective in solving TBGAP problems to optimality.

0 Followers
 · 
136 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Purpose ‐ This paper aims to construct for the first time a link between the project members' assignment and personality balance. Design/methodology/approach ‐ This study develops a project assignment quantitative model that maximizes the team's personality balance while meeting the capability requirements. Findings ‐ The findings indicate that a more balanced project team that contributes to project performance can be obtained before project starts. Research limitations/implications ‐ This paper is limited to the exploration of Belbin's personality types. However, it offers a generic approach that can be applied to other personality categorization. Practical implications ‐ The paper helps practitioners form a personality balanced project team to improve the project performance by reducing the complexity of project communication and problem solving. Originality/value ‐ The paper develops for the first time a project assignment model that considers both capability and personality and allocates project personnel in such a way that the most suitable personnel is selected from a group of qualified capable candidates, to increase the possibility of success for the project.
    Kybernetes 09/2013; 42(7). DOI:10.1108/K-10-2012-0096 · 0.42 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider a generalization of the well-known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single-period assignment costs and agent-capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single-period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation-based heuristic as well as a branch-and-bound algorithm for MultiGAP. Computational experience with the heuristic and branch-and-bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high-quality and in many cases near-optimal solutions. The branch-and-bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012
    Naval Research Logistics 09/2012; 59(6). DOI:10.1002/nav.21501 · 0.69 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 2014
    Naval Research Logistics 11/2014; DOI:10.1002/nav.21607 · 0.69 Impact Factor