Using a Modified Simulated Annealing Algorithm to Minimize Makespan in a Permutation Flow-shop Scheduling Problem with Job Deterioration

If the task has precedences, then the start time of the task is delimited by the ending time of the previous task with the spare time of the worker that will execute the task..

It clearly shows that the Average Relative Error for HGAPSA is 0.13 Table 3 shows comparison of makespan value produced from different algorithms for problem instances

This local search algorithm is called the Greedy Levy-based Local Search Algorithm (GLLSA). In GLLSA, a recruit bee restarts the search from the current best site in a

The first stage is to come up with a new steganography algorithm in order to hide the data inside the image and the second stage is to come up with a decryption algorithm using

This algorithm is contributing to the resolution of the problem of clustering in a multidimensional way by using algorithm DBSCAN [25] and integrating a model of

scheduling problem with unequal release date of jobs, worker with learning ability and the machine with deteriorating effect where the objective is the total weighted

algorithm for the no-wait flow shop scheduling problem with makespan criterion”, International Journal of Advanced Manufacturing Technology , vol. Chakraborty, “A

This work presents a genetic symbiotic algorithm to minimize the number of objects and the setup in a one-dimensional cutting stock problem.. The algorithm implemented can