An algorithm for the bottleneck generalized assignment problem

Fuqua School of Business, Duke University, Durham, NC 27706 USA; Kenan-Flagler Business School, Campus Box 3490, Carroll Hall, The University of North Carolina, Chapel Hill, NC 27599-3490, U.S.A.
Computers & Operations Research (Impact Factor: 1.72). 05/1993; DOI: 10.1016/0305-0548(93)90079-X

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.

  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper studies a production planning problem in printed circuit board (PCB) assembly. A PCB assembly line has several non-identical placement machines, so the placement times by different machines are various to the same type of components. Several mathematical models are formulated in order to obtain a best assignment of components to machines with the objective of minimizing the cycle time to have the best line throughput. Moreover, the data structures of the models are analyzed and compared with other similar models to search a good available algorithm. Finally, a numerical example is provided to illustrate these models and is solved by a computer package.
    Assembly Automation 02/2001; 21(1):55-60. · 0.71 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: We describe a branch and bound algorithm for an assignment problem subject to a special set of side constraints. The problem has application in the design of tool carousels for certain flexible manufacturing systems. The resulting model represents a special case of the restricted facilities layout problem in which it is forbidden to locate any facility in certain zones. The bounds for the algorithm are generated by relaxing the side constraints and using the Hungarian method to solve the resulting assignment problem. Partitioning in a manner similar to subtour elimination for the travelling salesman problem leads to encouraging computational results.
    Computers & Industrial Engineering 01/1999; 37(4):847-858. · 1.69 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A Two Stage Interval Time Minimizing Transportation Problem, where total availability of a homogeneous product at various sources is known to lie in a specified interval, is studied in the present paper. In the first stage, the sources ship all of their on-hand material to the demand points, while a second-stage delivery covers the demand that is not fulfilled in the first shipment. In each stage, the objective is to minimize the shipment time, and the overall goal is to find a solution that minimizes the sum of the first- and second- stage shipment times. A polynomial time algorithm is proposed to solve the problem to optimality, where at various steps of the algorithm lexicographic optimal solutions of restricted versions of a related standard time minimizing transportation problem are examined and finally the global optimal solution is determined.