Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 449 for “"assignment problem"”.

  1. Stochastic sequential assignment problem

    The stochastic sequential assignment problem (SSAP) studies the allocation of available distinct workers with deterministic values to sequentially-arriving tasks with stochastic parameters so as to maximize the expected total reward obtained from the assignments. The difficulty and challenge in …

    uiuc Repository record for Stochastic sequential assignment problem (opens in a new tab)

  2. Generalized sequential assignment problem

    The Sequential Stochastic Assignment Problem (SSAP) deals with assigning sequentially arriving tasks with stochastic parameters to workers with fixed success rates. The reward of each assignment is the product of the worker's success rate and the task value assigned to the worker. The objective is …

    uiuc Repository record for Generalized sequential assignment problem (opens in a new tab)

  3. The approximate determinantal assignment problem

    The Determinantal Assignment Problem (DAP) is one of the central problems of Algebraic Control Theory and refers to solving a system of non-linear algebraic equations to place the critical frequencies of the system to specied locations. This problem is decomposed into a linear and a multi-linear …

    city-london Download PDF for The approximate determinantal assignment problem (opens in a new tab)

  4. The naval officer assignment problem

    … system of the Navy is strongly dependent on the assignment officers' daily assignment decisions. The officer assignment problem is to determine the optimal assignment of officers to billets on a continuing time basis. A procedure is developed in this study by which ranked assignment alternatives …

    nps Repository record for The naval officer assignment problem (opens in a new tab)

  5. On the airport gate assignment problem

    This thesis focuses on the Airport Gate Assignment Problem both on the daily planning stage and the real-time recovery of flight schedule disruptions. We extended the integer programming model in literature to include more assignment criteria in practical airport operations. To improve the …

    nus Repository record for On the airport gate assignment problem (opens in a new tab) Download file for On the airport gate assignment problem (opens in a new tab)

  6. The assignment problem with dependent costs.

    … skills in an efficient manner is a challenging problem that often requires workers to receive additional training. The training of workers is very costly with Training Magazine’s Annual Industry Report stating 58.5 billion dollars were spent in 2007 on employee training in the United States. …

    louisville Repository record for The assignment problem with dependent costs. (opens in a new tab)

  7. The assignment problem in distributed computing

    <p>This dissertation focuses on the problem of assigning the modules of a program to the processors in a distributed system with the goal of minimizing the overall cost of running the program. The cost depends on the execution times of the modules on the processors and on the cost of communication …

    iastate Repository record for The assignment problem in distributed computing (opens in a new tab)

  8. Linear assignment problem with voxelized constraints

    DSpace SAF Submission Ingestion Package generated from Vireo submission #18312 on 2022-11-15 at 21:40:12

    uiuc Repository record for Linear assignment problem with voxelized constraints (opens in a new tab)

  9. Metaheuristics for the Generalized Quadratic Assignment Problem

    The generalized quadratic assignment problem (GQAP) is the task of assigning a set of facilities to a set of locations such that the sum of the assignment and transportation costs is minimized. The facilities may have different space requirements, and the locations may have varying space …

    wvu Repository record for Metaheuristics for the Generalized Quadratic Assignment Problem (opens in a new tab)

  10. Creating Initial Solutions for the Tail Assignment Problem

    One of many optimization problems in the airline industry is the tail assignment problem, i.e. to decide which aircraft operate which flight. Initial solutions can be used to warm-start optimization algorithms. In this thesis, the optimization algorithm uses a time window heuristic together with …

    chalmers Repository record for Creating Initial Solutions for the Tail Assignment Problem (opens in a new tab)

  11. Deterministic interchange algorithms for the quadratic assignment problem

    The quadratic assignment problem (QAP) is a combinatorial optimization problem in which the total cost of an assignment of objects (facilities) to sites (locations) is to be minimized. Unlike the linear assignment problem, the QAP explicitly considers the costs associated with the flow or …

    nebraska Repository record for Deterministic interchange algorithms for the quadratic assignment problem (opens in a new tab)

  12. Recommender Systems for the Conference Paper Assignment Problem

    Conference paper assignment---the task of assigning paper submissions to reviewers---is a key step in the management and smooth functioning of conferences. We study this problem as an application of recommender systems research. Besides the traditional goal of predicting `who likes what?', a …

    vt Repository record for Recommender Systems for the Conference Paper Assignment Problem (opens in a new tab)

  13. Heuristic Approaches to Solve the Frequency Assignment Problem

    The frequency assignment problem is a computationally hard problem with many applications including the mobile telephone industry and tactical communications. The problem may be modelled mathematically as a T-colouring problem for an undirected weighted graph; it is required to assign to each …

    goldsmiths Repository record for Heuristic Approaches to Solve the Frequency Assignment Problem (opens in a new tab) Download PDF for Heuristic Approaches to Solve the Frequency Assignment Problem (opens in a new tab)

  14. Heuristic Solution Approaches to the Solid Assignment Problem

    The 3-dimensional assignment problem, also known as the Solid Assignment Problem (SAP), is a challenging problem in combinatorial optimisation. While the ordinary or 2-dimensional assignment problem is in the P-class, SAP which is an extension of it, is NP-hard. SAP is the problem of allocating n …

    essex Download PDF for Heuristic Solution Approaches to the Solid Assignment Problem (opens in a new tab)

  15. Improving group role assignment problem by incremental assignment algorithm

    The Assignment Problem is a basic combinatorial optimization problem. In a weighted bipartite graph, the Assignment Problem is to find a largest sum of weights matching. The Hungarian method is a well-known algorithm which is combinatorial optimization. Adding a new row and a new column to a …

    laurentian Repository record for Improving group role assignment problem by incremental assignment algorithm (opens in a new tab)

  16. An approach to an assignment problem with hierarchical objectives

    … in assigning personnel to billets. For the assignment of Naval officers, these objectives in decreasing order of importance are to satisfy the needs of the Navy, to enhance the careers of officers, to fulfill the desires of officers, and to minimize cost. To assist in this complicated task, …

    nps Repository record for An approach to an assignment problem with hierarchical objectives (opens in a new tab)

  17. A modified greedy algorithm for the task assignment problem.

    … in an efficient and cost effective manner is a problem that nearly every company faces. This task assignment problem can be very time consuming to solve optimally. This difficulty increases as problem size increases. Most companies are large enough that it isn't feasible to find an optimal …

    louisville Repository record for A modified greedy algorithm for the task assignment problem. (opens in a new tab)

Page 1 of 23