A multi-objective genetic algorithm to solve a single machine scheduling problem with setup-times Online publication date: Tue, 13-Aug-2019
by Youssef Harrath; Amine Mahjoub; Jihene Kaabi
International Journal of Services and Operations Management (IJSOM), Vol. 33, No. 4, 2019
Abstract: The objective of this research is to study the one machine scheduling problem with setup-times. Two objectives were considered; the completion time and the total weighted tardiness. Only the static version of the problem was treated. The problem is NP-hard and not approximable. We proposed a multi-objective genetic algorithm with new crossover operators to solve the problem. To validate the algorithm, we conducted an intensive experimental study, which showed that the new operators allowed the genetic algorithm to generate Pareto optimal solutions close to many developed lower bounds.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com