in this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (mrcpsp) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. we present a depth-first branch and bound algorithm for the resource constrained project schedulin...

Given a bi-directed graph modeling telecommunication network, and set of origin-destination pairs representing traffic requests (commodities) along with their associated Service Function Chains (SFCs), the Virtual Network Placement Routing Problem (VNFPRP) aims to find, for each commodity, one latency-constrained routing path that visits required Functions in specific order. The function instal...

In this paper, multiple device-to-device (D2D) communication underlaying cellular multiuser multiple inputs multiple outputs (MU-MIMO) systems is investigated. This type of communication can improve spectral efficiency to address future demand, but interference management, user clustering, and resource allocation are three key problems related to resource sharing. Interference alignment (IA) is...

This paper develops a decentralized leader-follower game for network design of a competitive supply chain problem in which a new chain as the leader enters a market with one existing supply chain as a follower. Both chains produce an identical product, customer demand is inelastic and customer utility function is based on Huff gravity-based model. The leader wants to shape his network and set a...

One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...

Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...

We compare two branch-and-price approaches for the cutting stock problem. Each algorithm is based on a different integer programming formulation of the column generation master problem. One formulation results in a master problem with 0–1 integer variables while the other has general integer variables. Both algorithms employ column generation for solving LP relaxations at each node of a branch-...

University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...