Ben Coleman and Weizhen Mao Department of Computer S ien e, College of William & Mary, Williamsburg, VA 23187-8795, USA f oleman,wmg s.wm.edu Abstra t We onsider the unrelated ma hine s heduling problem where ea h job may have a di erent proessing time on ea h ma hine. This model a urately represents systems where ea h ma hine or worker has di erent abilities. A spe ial ase of this problem is t...

Evolutionary algorithms have shown great promise in evolving novel solutions to real-world problems, but the complexity of those solutions is limited, unlike the apparently open-ended evolution that occurs in the natural world. In part, nature surmounts these complexity barriers with ecological dynamics that generate a diverse array of raw materials for evolution to build upon. The authors prev...

This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated for other dynamic optimization problems with changing fitness landscapes, but only when associated with a fixed search space. In dynamic scheduling, the search space shifts as jobs are completed and new jobs arrive, so memory e...

Local Search (LS) and Evolutionary Algorithms (EA) are probabilistic search algorithms, widely used in global optimization, where selection is important as it drives the search. In this paper, we introduce acceptance, a metric measuring the selective pressure in LS and EA, that is the tradeoff between exploration and exploitation. Informally, acceptance is the proportion of accepted non-improvi...

In this paper a new evolutionary algorithm Sim-EA is presented. This algorithm is designed to tackle several instances of an optimization problem at once based on an assumption that it might be beneficial to share information between solutions of similar instances. The Sim-EA algorithm utilizes the concept of multipopulation optimization. Each subpopulation is assigned to solve one of the insta...

Traditional scheduling problems with the batch processing machines (BPM) assume that machines are continuously available, and no time is needed for their preventive maintenance (PM). In this paper, we study a realistic variant of flowshop scheduling which integrates flow shop batch processing machines (FBPM) and preventive maintenance for minimizing the makespan. In order to tackle the given pr...

A new modification of Electromagnetism-like (EM) algorithm which incorporating the Record-to-Record Travel (RRT) local search algorithm; namely MEMR has been developed to solve the problem of Inverse Kinematics (IK) for a four Degree-of-Freedom (DOF) manipulator. The proposed method is able to generate multiple robot configurations for the IK test performed at different end effect or positions....

The possibility of an incompletness of the equations of electromagnetism is analyzed using a thought experiment that shows a non-physical behavior according to classical electromagnetism. Basically, from Maxwell equations it is shown that a particular passive, isolated circuit could present a growth of its currents. Resolution of this problem is sought within the context of the usual electromag...