Frana, P.M., Mendes, A., Moscato, P.: A memetic algorithm for the total tardiness total tardiness single machine scheduling problem. European Journal of Operational Research 132 (2001) 224--242  Home/Search   Document Not in Database   Summary   Related Articles

....problem. SLS algorithms combine a local search algorithm with a probabilistic component. Well known SLS algorithms include tabu search, variable neighbourhood search, ant colony optimisation (ACO) and evolutionary algorithms. All of these have been applied to MPTTP or to closely related problems [4, 5, 11 16]. Currently, the best performing SLS algorithms for the single processor total tardiness and for the more difficult total weighted tardiness problem (SPTWTP) where each job is given an additional weight indicating its importance, are iterated local search algorithms [4, 5] Therefore, we also ....

....relative orderings and (ii) the jobs originating from # also maintain their positions in the priority list. Hence, we would expect that the start time of jobs in # that were copied from # remain approximately similar to the ones they had in #. This operator is based upon the strategy of Franca [16]. The two approaches differ mainly in that Franca chooses an interval in # which remains static, while we choose the jobs randomly, and Franca s implementation is for a single processor scheduling problem, while ours is for the MPTTP. 5 Empirical Analysis This sections describes the benchmark ....

Frana, P.M., Mendes, A., Moscato, P.: A memetic algorithm for the total tardiness total tardiness single machine scheduling problem. European Journal of Operational Research 132 (2001) 224--242

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC