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

Completeness and universal constraints in the correction problem for heuristic classification algorithms

โœ Scribed by K. V. Rudakov


Publisher
Springer US
Year
1988
Tongue
English
Weight
497 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Genetic algorithms for the job-shop sche
โœ Fatima Ghedjati ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an