This paper proposes a new mixed-integer model for the multi-skill resource-constrained project scheduling problem (MSRCPSP). The interactions between workers are represented as undirected networks. Therefore, for each required skill, an undirected network is formed which shows the relations of human resources. In this paper, community detection in networks is used to find the most compatible wo...

This paper studies a planning problem for heating water. Hereby, boilers (e.g. gas or electric boilers, heat pumps microCHPs) are used to the water and store it domestic demands. We consider simple boiler which is either turned on off has buffer of limited capacity. The energy needed run be bought day-ahead market, so we interested in minimizes cost supply with energy. present greedy algorithm ...

During the last decades, hundreds of approximate algorithms have been proposed in literature addressing flow-shop-based scheduling problems. In race for finding best proposals to solve these problems, speed-up procedures compute objective functions represent a key factor efficiency algorithms. This is case well-known Taillard’s accelerations traditional flow shop with makespan minimisation or s...

in this paper, tender problems in an automobile company for procuring needed items from potential suppliers have been resolved by the learning algorithm q. in this case the purchaser with respect to proposals received from potential providers, including price and delivery time is proposed; order the needed parts to suppliers assigns. the buyer’s objective is minimizing the procurement costs thr...

The problem of task assignment is one of the most fundamental among combinatorial optimization problems. Solving the Task Assignment Problem is very important for many real time and computational scenarios where a lot of small tasks need to be solved by multiple processors simultaneously. A classic problem that confronts computer scientists across the globe pertaining to the effective assignmen...

Abstract The simultaneous eating algorithm (SEA) and probabilistic serial (PS) mechanism are well known for allocating a set of divisible or indivisible goods to agents with ordinal preferences. PS is SEA at the same speed. prominent property efficiency. Recently, we extended (EPS) from fixed quota each good variable varying in polytope constrained by submodular functions. In this article, furt...