The transportation processes for patients, personnel, and material in large and complex maximum-care hospitals with many departments can consume significant resources and thus induce substantial logistics costs. These costs are largely determined by the allocation of the different departments...

We consider a generalization of the classical quadratic assignment problem, where material flows between facilities are uncertain, and belong to a budgeted uncertainty set. The objective is to find a robust solution under all possible scenarios in the given uncertainty set. We present an exact...

This paper addresses an airport gate assignment problem with multiple objectives. The objectives are to minimize the number of ungated flights and the total passenger walking distances or connection times as well as to maximize the total gate assignment preferences. The problem examined is an...

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy...

In today's manufacturing outlook, coordinated scheduling of delivery and inventory represents a leading leverage to enhance the competitiveness of firms which aims to address the new challenge coming from scheduling problems. Though in the last decades this kind of issue has been extensively...

A recurring problem in project management involves the allocation of scarce resources to the individual jobs comprising the project. In many situations such as audit scheduling, the resources correspond to individuals (skilled labour). This naturally leads to an assignment type project...

The cell formation (CF) is one of the most important steps in the design of a cellular manufacturing system (CMS), which it includes machines' grouping in cells and part grouping as separate families, so that the costs are minimized. The various aspects of the problem should be considered in a...

Not all problem instances in combinatorial optimization are equally hard. One famous study "Where the Really Hard Problems Are" shows that for three decision problems and one optimization problem, computational costs can vary dramatically for equally sized instances. Moreover, runtimes could be...

The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear...

The concept of partially renewable resources provides a general modeling framework that can be used for a wide range of different real-life applications. In this paper, we consider a resource-constrained project duration problem with partially renewable resources, where the temporal constraints...