We survey sollltion methods for the job shop scheduling problem with an emphasis on local seareh. We discuss both cleterministie and randomized loeal seareh methods as weil as the applied neighborhoods. We eompare the eomputational performance of the various methods in terms of their effectiveness and efficiency on a standard set of problem instauces.

No abstract

We consider the problem of finding values of A3(n, d), i.e. the maximal size of a ternary code of length n and minimum distance d. Our approach is based on a search for good lower bounds and a comparison of these bounds with known upper bounds. Several lower bounds are obtained using a genetic local search algorithm. Other lower bounds are obtained by constructing codes. For those cases in which lower and upper bounds coincide, this yields exact values of A3(n, d). A table is included containing the known values of the upper and lower bounds for A3(n, d), with n ::; 16. For some values of nand d the corresponding codes are given.

No abstract