2014
DOI: 10.1002/nav.21607
|View full text |Cite
|
Sign up to set email alerts
|

Bicriteria multiresource generalized assignment problem

Abstract: In this study,we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0
1

Year Published

2018
2018
2021
2021

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 29 publications
0
3
0
1
Order By: Relevance
“…Taking the workload allocation example, a motivating case is a problem faced by a firm working in the heating ventilation and air conditioning (HVAC) sector in Turkey ( Karsu and Azizog l u, 2012 ;Karsu & Azizog l u, 2014 ). The manager faces the problem of assigning staff (agents) to tasks such that once assigned the agent will perform the task for multiple periods.…”
Section: The Problem Of Fair Allocation and Application Domainsmentioning
confidence: 99%
“…Taking the workload allocation example, a motivating case is a problem faced by a firm working in the heating ventilation and air conditioning (HVAC) sector in Turkey ( Karsu and Azizog l u, 2012 ;Karsu & Azizog l u, 2014 ). The manager faces the problem of assigning staff (agents) to tasks such that once assigned the agent will perform the task for multiple periods.…”
Section: The Problem Of Fair Allocation and Application Domainsmentioning
confidence: 99%
“…It is a modification of best‐first search that creates a search tree, and then uses breadth‐first search. It lends itself easily to providing multiple solutions (by sampling at various stages of the beam search) that are typically diverse in the spending of the portfolios generated, and can be sorted to provide a set of nondominated solutions, which we can later use to seed our genetic algorithm (Karsu & Azizoğlu, 2014). The fact that multiple solutions can be evaluated at every stage of the beam search also makes it attractive due to the opportunity for parallelization it offers when being implemented on a computing system with access to a parallel computing cluster.…”
Section: Modeling Frameworkmentioning
confidence: 99%
“…Özçelik ve Saraç [39] uygunluk kısıtları olan darboğaz MRGAP problemi için bir matematiksel model önermişlerdir. Karsu ve Azizoglu [40], toplam yükün enküçüklenmesi ve en çok yüke sahip ajanın yükünün enküçüklenmesi olmak üzere iki amaçlı MRGAP'ı ele almıştır. MRGAP literatürü çözüm yöntemleri açısından incelendiğinde, çözüm yöntemlerinin kesin çözüm yöntemleri ( [30], [36]- [39]), sezgisel ([33]- [35], [40]) ve metasezgisel yöntemler ( [40]) olarak gruplanabileceği görülmektedir.…”
Section: Gi̇ri̇ş (Introduction)unclassified