|
|
|
|
|
Alessandro Agnetis, Fabrizio Rossi and Stefano Smriglio
We address some special cases of job shop and flow shop scheduling problems with s-precedence constraints. Unlike the classical setting, in which precedence constraints among the tasks of a job are finish?start, here the task of a job cannot start before...
ver más
|
|
|
|
|
|
|
|
|
Ling Xu, Jianzhong Qiao, Shukuan Lin and Ruihua Qi
In volunteer computing (VC), the expected availability time and the actual availability time provided by volunteer nodes (VNs) are usually inconsistent. Scheduling tasks with precedence constraints in VC under this situation is a new challenge. In this p...
ver más
|
|
|
|
|
|
|
|
|
Amjad Mahmood, Salman A. Khan and Rashed A. Bahlool
In the Infrastructure-as-a-Service cloud computing model, virtualized computing resources in the form of virtual machines are provided over the Internet. A user can rent an arbitrary number of computing resources to meet their requirements, making cloud ...
ver más
|
|
|
|
|
|
|
|
|
Edgar Gutiérrez Franco,Fernando La Torre Zurita,Gonzalo Mejía Delgadillo
This paper proposes a Genetic Algorithm (GA) for the Resource Constrained Project Scheduling Problem (RCPSP). Resources are renewable and there is a unique way to perform the activities. This work employs Genetics Algorithms to schedule project act...
ver más
|
|
|
|
|
|
|
|
|
Maurice Queyranne and Andreas S. Schulz
Pág. 1241 - 1253
|
|
|
|