A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructed by using the current solution is developed to solve a classical multiprocessor scheduling problem with the objective of minimizing the makespan. Computational results indicate that the proposed algorithm is very competitive with respect toâ€¦ (More)

A new unrelated parallel machine scheduling problem with deteriorating 26 effect and the objective of makespan minimization is presented in this paper. The 27 deterioration of each machine (and therefore of the job processing times) is a function of the 28 sequence of jobs that have been processed by the machine and not (as considered in the 29 literature)â€¦ (More)

A new, simple and e!ective heuristic algorithm has been developed for the period traveling salesman problem. Computational results obtained from the test problems taken from the literature indicate that the algorithm compares well in terms of accuracy with other existing algorithms, "nding a larger number of best solutions. Moreover, its average percentageâ€¦ (More)

A composite algorithm is developed for the classical problem of scheduling independent jobs on identical parallel machines with the objective of minimizing the makespan. The algorithm at first obtains a family of initial partial solutions and combines these partial solutions until a feasible solution is generated. Then local search procedures are used forâ€¦ (More)