๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Genetic algorithm for test scheduling with different objectives

โœ Scribed by R. Chandrasekharam; V.V. Vinod; S. Subramanian


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
564 KB
Volume
17
Category
Article
ISSN
0167-9260

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Approximation algorithms for shop schedu
โœ Maurice Queyranne; Maxim Sviridenko ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 166 KB

We consider a general class of multiprocessor shop scheduling problems, preemptive or non-preemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We