✦ 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
DOI: 10.1007/bf01074835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Universal and local constraints in the p

Universal and local constraints in the problem of correction of heuristic algorithms

✍ K. V. Rudakov 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 710 KB

Symmetric and functional constraints in

Symmetric and functional constraints in the correction problem of heuristic classification algorithms

✍ K. V. Rudakov 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 559 KB

Genetic algorithms for the job-shop sche

Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence

✍ 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