Projekt 4. - Institut for Matematik og Datalogi - Syddansk Universitet

N a t u r v i d e n s k a b e l i g t P r o j e k t / F a r m a c e u t : V a l g f r i t P r o j e k t
Projekt 50. Online Job Assignment
Vejleder: Sushmita Gupta, sgupta@imada.sdu.dk
Institut: Department of Mathematics and Computer Science (IMADA)
Praktisk del: IMADA
Gruppeplacering: IMADA Library
Gruppestørrelse: minimum 3 and maximum 5 participants. One group can work on this project
Kommentarer: Projektet er sœrligt velegnet til studieordning i datalogi / The project is specially
suitable for students with curriculum in computer
Keywords:
Matching, bipartite graph, online algorithm, offline algorithm
Abstract
Consider a job assignment office, JAO, which matches job applicants with available positions
depending on suitability and availability. Each applicant has a set of skills which makes him/her
suitable for certain types of jobs.
These assignments happen in a rolling basis, i.e, as jobs become available and interested candidates
sign-up, the JAO makes a job-assignment (if it can) from the pool of unassigned candidates.
If there are none available, then it searches the list of currently assigned candidates
for someone who could potentially be assigned to a job which is unsuitable for any of the unattached
candidates. An important condition for a job switch is that a previously assigned job
cannot be halted because its worker has been assigned to something else. Therefore the JAO
has a policy to make a switch only if there is an unassigned candidate who can take up that
job.
Too many job switches is perhaps not beneficial for the candidates, so a priori the JAO decides
to limit the possible number of reassignments any candidate has to undergo to be no
more than a small constant k, such as 2 or 3. The main goal is to maximize the number of job
assignments.
Situations of this nature are commonly encountered in problems related to ¨bipartite matching¨,
both ¨online¨ as well as ¨offline¨. The goal of this project is to study and implement
strategies which lead to optimal or at least close to optimal solutions.
There is a lot of literature on this topic, both introductory and advanced. We will refer to
some of them as a starting point and then try to glean ideas to develop our own strategies to
make switches or to deduce examples when switching leads to no extra benefit.
Minikurser
Obligatorisk: Projektarbejde (LaTeX).
Anbefalede: Ingen
Litteraturliste over metode artikler, som udleveres til de studerende
Possible example- Chapter 3 : „‟Introduction to Graph Theory‟‟ by Douglas West.
52