Parallel machine scheduling, involves the allocation of jobs to the system resources (a bank of machines in parallel). A basic model consisting of m machines and n jobs is the foundation of more complex models. Here, jobs are allocated according to resource availability following some allocation rule. In the specialised literature, minimisation of the makespan has been extensively approached and benchmarks can be easily found. This is not the case for other important objectives such as the due date related objectives. To solve the unrestricted parallel machine scheduling problem, this paper proposes MCMP-SRI and MCMP-SRSI, which are two multirecombination schemes that combine studs, random and seed immigrants. Evidence of the improved behaviour of the EAs when inserting problem-specific knowledge with respect to SCPC (an EA without multirecombination) is provided. Experiments and results are discussed. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Ferretti, E., Esquivel, S., & Gallard, R. (2004). Studs, seeds and immigrants in evolutionary algorithms for unrestricted parallel machine scheduling. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3315, pp. 174–184). Springer Verlag. https://doi.org/10.1007/978-3-540-30498-2_18
Mendeley helps you to discover research relevant for your work.