Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  presents a hybrid memetic algorithm for the problem of scheduling n jobs on m unrelated parallel machines with the objective of maximizing the ighted number of jobs that are completed exactly at their due dates. For each job, due date, ight, and the processing times on different machines are given. It has been shown that when the numbers of machines are a part of input, this problem is NP-hard in the strong sense. At first, the problem is formulated as an integer linear programming model. This model is practical to solve small-size problems. Afterward, a hybrid memetic algorithm is implemented which uses two heuristic algorithms as constructive algorithms, making initial population set. A data oriented mutation operator is implemented so as to facilitate memetic algorithm search process. Performance of all algorithms including heuristics (H1 and H2), hybrid genetic algorithm and hybrid memetic algorithm are evaluated through computational experiments which shod the capabilities of the proposed hybrid algorithm.
['Fariborz Jolai', 'Mohsen Sadegh Amalnick', 'Mohammad Alinaghian', 'Majid Shakhsi-Niaei', 'H. Omrani']
I am writing a research paper on a idea A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines
[{"from": "human", "value": "I am writing a research paper on a idea A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  presents a hybrid memetic algorithm for the problem of scheduling n jobs on m unrelated parallel machines with the objective of maximizing the ighted number of jobs that are completed exactly at their due dates. For each job, due date, ight, and the processing times on different machines are given. It has been shown that when the numbers of machines are a part of input, this problem is NP-hard in the strong sense. At first, the problem is formulated as an integer linear programming model. This model is practical to solve small-size problems. Afterward, a hybrid memetic algorithm is implemented which uses two heuristic algorithms as constructive algorithms, making initial population set. A data oriented mutation operator is implemented so as to facilitate memetic algorithm search process. Performance of all algorithms including heuristics (H1 and H2), hybrid genetic algorithm and hybrid memetic algorithm are evaluated through computational experiments which shod the capabilities of the proposed hybrid algorithm."}]