Buscar

Mostrando ítems 1-10 de 1245

Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time

Kramer, Arthur Harry Frederico Ribeiro; Dell’Amico, Mauro; Feillet, Dominique; Iori, Manuel (Elsevier, 2020)

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective.

Pereira, Jordi

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

Pereira, Jordi

Optimal algorithms for scheduling under time-of-use tariffs

Chen L.; Megow N.; Rischke R.; Stougie L.; Verschae J. (Springer, 2021)

© 2021, The Author(s).We consider a natural generalization of classical scheduling problems to a setting in which using a time unit for processing a job causes some time-dependent cost, the time-of-use tariff, which must ...

Performance guarantees of local search for minsum scheduling problems

Correa Haeussler, José; Muñoz, Felipe T. (Springer, 2020)

We study the worst-case performance guarantee of locally optimal solutions for the problem of minimizing the total weighted and unweighted completion time on parallel machine environments. Our method makes use of a mapping ...

Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines

Kramer, Arthur Harry Frederico Ribeiro; Dell’Amico, Mauro; Iori, Manuel (Elsevier, 2020)

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

Autor desconocido (WILEY, 2012)

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social costNAVAL RESEARCH LOGISTICS (PRINT)NAV RES LOGIST (PRINT)

Correa, Jose R.; Queyranne, Maurice (WILEY, 2012)

Complexity of the cluster deletion problem on subclasses of chordal graphs

Bonomo, Flavia; Duran, Guillermo Alfredo; Valencia Pabon, Mario (Elsevier Science, 2015-10)

We consider the following vertex-partition problem on graphs, known as the CLUSTER DELETION (CD) problem: given a graph with real nonnegative edge weights, partition the vertices into clusters (in this case, cliques) to ...

Modelo experimental de úlcera traumática em mucosa jugal de ratos

UFC; Universidade Estadual Paulista (Unesp); Odontology and Nursing College (2011-05-01)

Purpose: To establish an experimental model of traumatic ulcer in rat cheek mucosa for utilization in future alternative therapy studies. Methods: A total of 60 adult male rats (250 - 300g) were used. Ulceration of the ...

1
2
3
4
. . .
125