Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Personnel assignment problem with hierarchical ordering constraints
Date
2003-10-01
Author
Toroslu, İsmail Hakkı
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
210
views
0
downloads
Cite This
In the standard assignment problem, there is no constraint on the partitions of the bipartite graph. The only objective is to maximize the summation of the weights of the matched edges. Any node in one partition can be matched with any node in the other partition without any restriction. In this paper, we study a variation of the standard assignment problem, having some ordering constraints on the partitions of the bipartite graph. We call this problem as 'assignment problem with hierarchical ordering constraint' (APHOC). As its name implies, hierarchical constraints are introduced on both partitions, and, the matching between the partitions should respect these hierarchical ordering constraints. A natural version of such constraints occurs in personnel assignment problem, where one of the partitions is a level graph representing the ranks of personnel, and the other one is a forest, representing the positions. We will first show that this problem is NP-complete. Then, we will investigate some heuristic and approximate solutions. Finally, we will study the performances of these solutions.
Subject Keywords
General Engineering
,
General Computer Science
URI
https://hdl.handle.net/11511/34740
Journal
COMPUTERS & INDUSTRIAL ENGINEERING
DOI
https://doi.org/10.1016/s0360-8352(03)00045-7
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Single machine scheduling with maximum earliness and number tardy
Azizoğlu, Meral; Koksalan, M (Elsevier BV, 2003-08-01)
In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for <LF>generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite fu...
Parallel Scalable PDE Constrained Optimization Antenna Identification in Hyperthermia Cancer Treatment Planning
SCHENK, Olaf; Manguoğlu, Murat; CHRİSTEN, Matthias; SATHE, Madan (Springer Science and Business Media LLC, 2009-01-01)
We present a PDE-constrained optimization algorithm which is designed for parallel scalability on distributed-memory architectures with thousands of cores. The method is based on a line-search interior-point algorithm for large-scale continuous optimization, it is matrix-free in that it does not require the factorization of derivative matrices. Instead, it uses a new parallel and robust iterative linear solver on distributed-memory architectures. We will show almost linear parallel scalability results for t...
girdap: Open source object-oriented autonomous grid management library for solving equations of conservation laws
Uzgoren, Eray (Elsevier BV, 2017-10-12)
girdap is an object-oriented grid generation and management library that uses finite volume operator objects to provide researchers and educators a framework to solve different sets of algebraic and differential equations on multiple grid objects, which are allowed to interact with each other. Grid objects have the capability of performing local anisotropic grid refinement (h-adaptation) as well as relocating their vertices (r-adaptation) to resolve length scales based on solution field obtained using algeb...
Statistical tolerancing using designed experiments in a noisy environment
Köksal, Gülser (Elsevier BV, 2003-03-01)
We consider the method of designed experiments for statistical tolerance analysis, and study the impact of experimental error on its results.-It is observed that presence of random error in the experiment environment (e.g. laboratory) could introduce bias in the moment estimators and increases their-respective variances. We propose adjustments to the method that would reduce the bias as well as the variance of these estimators. A numerical example is presented.
Sphere-packing bound for block-codes with feedback and finite memory
Giacomo, Como; Nakiboğlu, Barış (2010-07-23)
A lower bound bound is established on the error probability of fixed-length block-coding systems with finite memory feedback, which can be described in terms of a time dependent finite state machine. It is shown that the reliability function of such coding systems over discrete memoryless channels is upper-bounded by the sphere-packing exponent.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
İ. H. Toroslu, “Personnel assignment problem with hierarchical ordering constraints,”
COMPUTERS & INDUSTRIAL ENGINEERING
, pp. 493–510, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34740.