The multi-resource agent bottleneck generalised assignment problem

Karsu, Özlem; Azizoğlu, Meral

doi:10.1080/00207543.2010.538745

Cited by 23 publications

(18 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Representative studies in this area can be categorised as follows. Resource assignment results can be found in Ait-Kadia, Menye and Kane (2011), Bachlaus, Tiwarib, andChan (2009), Celano, Costa, andFichera (2008), Eckstein and Rohleder (1998), Hwang and Kogan (2003) and Karsu and Azizoglu (2012). Resource-constrained project scheduling with a single type of resource can be found in Brucker and Kramer (1996), Chan, Wong, and Chan (2006), Debels and Vanhoucke (2007), Deblaere et al (2007), Herroelen (2011a, 2011b), Depuy and Whitehouse (2001), Klein (2000), Ranjbar, Reyck, and Kianfar (2009), Robinson and Moses (2006), Schirmer (2001), Tormos and Lova (2003), Vanhoucke, Demeulemeester, and Herroelen (2001b) and Van de Vonder et al (2006).…”

Section: Introductionmentioning

confidence: 94%

Operations scheduling with multiple resources and transportation considerations

Lee

Lei

Pinedo

et al. 2013

International Journal of Production Research

View full text Add to dashboard Cite

We study a scheduling problem with the operations that require renewable as well as non-renewable resources. After an operation has been completed, the non-renewable resource is depleted whereas the renewable resource can be made available for the next operation. Of both the renewable and the non-renewable resources limited amounts are available and they need to be transported to the locations where they are needed. The operations have deadlines, and the availability of the renewable resources depends on the sequence of the operations. Such operations scheduling problems are commonly encountered in the practices of emergency logistics that deliver medical services to the affected areas after a disaster, where renewable resources typically refer to medical teams and non-renewable resources refer to medical supplies. We present a complexity classification for our problem and show where the borderline lies between NP-hardness and polynomial time solvability. We analyse the structural properties of our problem, provide strongly polynomial-time solutions for four special cases and list the cases that are computationally intractable. Finally, we propose a framework of heuristic procedures for solving more general versions of this problem.

show abstract

Section: Introductionmentioning

confidence: 94%

Operations scheduling with multiple resources and transportation considerations

Lee

Lei

Pinedo

et al. 2013

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…Martello and Toth [16] present a B&B algorithm and several approximation algorithms. Karsu and Azizoglu [15] address the MRGAP that minimizes the maximum cost among all agents. They propose a B&B algorithm that uses the optimal solutions of the linear programming relaxations (LPRs).…”

Section: Literature Reviewmentioning

confidence: 99%

“…We implement two TS algorithms, namely TS M and TS T . TS M is the algorithm proposed by Karsu and Azizoglu [15] for the single objective min-max (min Z M ) problem. It starts with a feasible solution, which is found by modifying the optimal LPR solution of a min-max problem by assigning each fractional task to its highest fractional agent, as long as the assignment is feasible.…”

Section: Tabu Search Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Bicriteria multiresource generalized assignment problem

Karsu

Azizoğlu

2014

Naval Research Logistics

Self Cite

View full text Add to dashboard Cite

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

show abstract

“…Completion time of the jobs also can be taken into account. In other words, completion time of the last job is minimized in the BAP [3]. GAP is an important problem frequently studied in literature.…”

Section: Introductionmentioning

confidence: 99%

A multi-start iterated tabu search algorithm for the multi-resource agent bottleneck generalized assignment problem

Bektur¹

2019

Int. J. Optim. Control, Theor. Appl. (IJOCTA)

View full text Add to dashboard Cite

In this study, a multi-resource agent bottleneck generalized assignment problem (MRBGAP) is addressed. In the bottleneck generalized assignment problem (BGAP), more than one job can be assigned to an agent, and the objective function is to minimize the maximum load over all agents. In this problem, multiple resources are considered and the capacity of the agents is dependent on these resources and it has minimum two indices. In addition, agent qualifications are taken into account. In other words, not every job can be assignable to every agent. The problem is defined by considering the problem of assigning jobs to employees in a firm. BGAP has been shown to be NP- hard. Consequently, a multi-start iterated tabu search (MITS) algorithm has been proposed for the solution of large-scale problems. The results of the proposed algorithm are compared by the results of the tabu search (TS) algorithm and mixed integer linear programming (MILP) model.

show abstract

The multi-resource agent bottleneck generalised assignment problem

Cited by 23 publications

References 17 publications

Operations scheduling with multiple resources and transportation considerations

Operations scheduling with multiple resources and transportation considerations

Bicriteria multiresource generalized assignment problem

A multi-start iterated tabu search algorithm for the multi-resource agent bottleneck generalized assignment problem

Contact Info

Product

Resources

About