Assignment Problem Research Papers - Academia.edu (original) (raw)

Optimization in sports is a field of increasing interest. Com- binatorial optimization techniques have been applied e.g. to game schedul- ing and playoff elimination. A common problem usually found in sports management is the assignment... more

Optimization in sports is a field of increasing interest. Com- binatorial optimization techniques have been applied e.g. to game schedul- ing and playoff elimination. A common problem usually found in sports management is the assignment of referees to games already scheduled. There are a number of rules and objectives that should be taken into ac- count when referees are assigned

Abstract. In this paper, a decision support tool that automates crew recovery during irregular operations for large-scale commercial airlines is presented. The tool is designed for airlines that adopt the hub-spoke network stru cture. The... more

Abstract. In this paper, a decision support tool that automates crew recovery during irregular operations for large-scale commercial airlines is presented. The tool is designed for airlines that adopt the hub-spoke network stru cture. The advance of this tool over the existing ones is ...

Wade D. Cook Schulich School of Business, York University, Toronto, Ontario M3J 1P3, Canada, wcook@schulich.yorku.ca Boaz Golany Faculty of Industrial Engineering and Management, Technion?Israel Institute of Technology, Haifa 32000,... more

Wade D. Cook Schulich School of Business, York University, Toronto, Ontario M3J 1P3, Canada, wcook@schulich.yorku.ca Boaz Golany Faculty of Industrial Engineering and Management, Technion?Israel Institute of Technology, Haifa 32000, Israel, golany@ie. ...

Abstract. Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Pro-blem, in which a limited number of referees with different qualifications and availabilities should be... more

Abstract. Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Pro-blem, in which a limited number of referees with different qualifications and availabilities should be assigned to a set of games already sched-uled. We extend ...

The assignment – selection problem used to find one-to- one match of given “Users” to “Laptops”, the main objective is to minimize the cost as per user requirement. This paper presents satisfactory solution for real assignment – Laptop... more

The assignment – selection problem used to find one-to- one match of given “Users” to “Laptops”, the main objective is to minimize the cost as per user requirement. This paper presents satisfactory solution for real assignment – Laptop selection problem using MATLAB coding.

This article presents a new partial eigenstructure assignment method. This technique keeps the open-loop stable eigenvalues and the corresponding eigenspace unchanged. The remaining undesirable eigenvalues are replaced by other chosen... more

This article presents a new partial eigenstructure assignment method. This technique keeps the open-loop stable eigenvalues and the corresponding eigenspace unchanged. The remaining undesirable eigenvalues are replaced by other chosen values. This methodology is easy and permits to overcome some limitations encountered in the previous methods. Furthermore, our method is applied to solve the constrained control problem for linear invariants continuous-time systems. Indeed, the problem of finding a stabilising regulator matrix gain taking into account the asymmetrical control constraints is transformed to a Sylvester equation resolution. Examples are given to illustrate the obtained results.

The school timetabling problem, although less complicated than its counterpart for the university, still provides a ground for interesting and innovative approaches that promise solutions of high quality. In this work, a Shift Assignment... more

The school timetabling problem, although less complicated than its counterpart for the university, still provides a ground for interesting and innovative approaches that promise solutions of high quality. In this work, a Shift Assignment Problem is solved first and work shifts are assigned to teachers. In the sequel, the actual Timetabling Problem is solved while the optimal shift assignments that resulted from the previous problem help in defining the values for the cost coefficients in the objective function. Both problems are modelled using Integer Programming and by this combined approach we succeed in modelling all operational and practical rules that the Hellenic secondary educational system imposes. The resulting timetables are conflict free, complete, fully compact and well balanced for the students. They also handle simultaneous, collaborative and parallel teaching as well as blocks of consecutive lectures for certain courses. In addition, they are highly compact for the teachers, satisfy the teachers’ preferences at a high degree, and assign core courses towards the beginning of each day.

Sensor-target and weapon-target pairings are important activities involved in planning and executing a course-of-action in a modern warfare. The outcome of today's combat operations may strongly depend on the intelligent usage of... more

Sensor-target and weapon-target pairings are important activities involved in planning and executing a course-of-action in a modern warfare. The outcome of today's combat operations may strongly depend on the intelligent usage of available sensors and weapons maximizing their effectiveness. The problem can be considered as an assignment optimization problem in mathematics. This problem is difficult because in the real world

Food banks are privately-owned non-profit organizations responsible for the receipt, processing, storage, and distribution of food items to charitable agencies. These charitable agencies in turn distribute food to individuals at risk of... more

Food banks are privately-owned non-profit organizations responsible for the receipt, processing, storage, and distribution of food items to charitable agencies. These charitable agencies in turn distribute food to individuals at risk of hunger. Food banks receive donated food from national and local sources, such as The Emergency Food Assistance Program (TEFAP) and supermarkets. Local sources with frequent high-volume donations justify the use of food bank vehicles for collection. Food bank vehicles are also used to deliver food to rural charitable agencies that are located beyond a distance safe for perishable food to travel without spoilage. Due to limited funds, food banks can only afford to sparingly use their capital on non-food items. This requires exploring more cost effective food delivery and collection strategies. The goal of this paper is to develop transportation schedules that enable the food bank to both (i) collect food donations from local sources and (ii) to deliver food to charitable agencies. We identify satellite locations, called food delivery points (FDPs), where agencies can receive food deliveries. A set covering model is developed to determine the assignment of agencies to a FDP. Both vehicle capacity and food spoilage constraints are considered during assignment. Using the optimal assignment of agencies to FDPs, we identify a weekly transportation schedule that addresses collection and distribution of donated food and incorporates constraints related to food safety, operator workday, collection frequency, and fleet capacity.

In this paper, a crew-scheduling problem has been formulated considering the daily assignment of a set of crew staff to their round-trips for all the public transports (e.g. train, bus or air bus) that will minimize the waiting times and... more

In this paper, a crew-scheduling problem has been formulated considering the daily assignment of a set of crew staff to their round-trips for all the public transports (e.g. train, bus or air bus) that will minimize the waiting times and total service times (including waiting times) of all crews separately. In this approach, the waiting times as well as the service times of crews have been taken as intervals. Here the problem has been formulated as a multi-objective assignment problem using interval arithmetic and the order relations (for the case of pessimistic decision making) that represent the decision maker’s preference between interval times. For this purpose, we have used the existing complete definition of order relations recently developed. Finally, the reformulated problem has been converted to a single objective optimization problem using Global Criterion Method and then solved the same by tournament genetic algorithm. The experimental results of the proposed approach to a crew-scheduling problem have been reported.

In this paper we introduce the notion of approximate da2a siruclures, in which a small amount of error is tolerated in the output. Approximate data structures trade error of approximation for faster operation, leading to theoretical and... more

In this paper we introduce the notion of approximate da2a siruclures, in which a small amount of error is tolerated in the output. Approximate data structures trade error of approximation for faster operation, leading to theoretical and practical speedups for a wide variety of algorithms. We give approximate variants of the van Emde Boas data structure, which support the same dynamic operations as the standard van Emde Boas data structure [28, 201, except that answers to queries are approximate. The variants support all operations in constant time provided the error of approximation is l/polylog(n), and in O(loglog n) time provided the error is l/polynomial(n), for n elements in the data structure. We consider the tolerance of prototypical algorithms to approximate data structures. We study in particular Prim’s minimumspanning tree algorithm, Dijkstra’s single-source shortest paths algorithm, and an on-line variant of Graham’s convex hull algorithm. To obtain output which approximat...