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

A hybrid genetic algorithm for integrated process planning and scheduling problem with precedence constraints

โœ Scribed by M. R. Amin-Naseri; Ahmad J. Afshari

Publisher
Springer
Year
2011
Tongue
English
Weight
587 KB
Volume
59
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Genetic algorithms for integrated preven
Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine
โœ N. Sortrakul; H.L. Nachtmann; C.R. Cassady ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 142 KB

Despite the inter-dependent relationship between them, production scheduling and preventive maintenance planning decisions are generally analyzed and executed independently in real manufacturing systems. This practice is also found in the majority of the studies found in the relevant literature. In