The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA,...

Increasing the complexity of the foreign exchange market as the world's largest financial market, has led to a lot of instability and noise in exchange rate series as a result of a considerable increase in speculator participants. The exchange rate forecast will be disturbed by this great noise....