abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...

1. An overview of C. elegans genetics ............................................................................................. 2 1.

Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local search-based metaheuristics to improve their behavior. This paper focuses on experimentally investigating the role of a recent approach, the binary-coded local genetic algorithm (BLGA), as context-independent local search o...

−We investigate the performance of a classical constrained optimisation (CCO) algorithm and a constrained optimisation Genetic Algorithm (GA) for solving the Bandwidth Allocation for Virtual Paths (BAVP) problem. We compare throughput, fairness and time complexity of GA-BAVP and CCO-BAVP for several node topologies. The results on maximising the throughput obtained with GA-BAVP and CCOBAVP are ...