scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

The software project scheduling problem considers the assignment of employees to project tasks with the aim of minimizing the project cost and delivering the project on time. Recent research takes into account that each employee is proficient in some development tasks only, which requiere specific skills. However, this cannot be totally applied in the Mexican context due to software companies d...

the research on project scheduling has widely expanded over the last few decades. the vast majority of these research efforts focus on exact and suboptimal procedures for constructing a workable schedule, assuming complete information and a static deterministic problem environment. project activities are scheduled subject to both technological precedence constraints and resource constraints, mo...

In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multi-mode execution activit...

In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...

The software project scheduling (SPS) problem deals with optimal allocation of employees to tasks such that the is completed within budget and schedule. This well addressed in absence dynamic events has been demonstrated SPS research static scenarios only. development methodologies have evolved where customer requirements are not initially locked but flexible take into account ongoing additiona...

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...

in this paper, a new genetic algorithm (ga) is presented for solving the multi-mode resource-constrained project scheduling problem (mrcpsp) with minimization of project makespan as the objective subject to resource and precedence constraints. a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (mssg...