A multi-objective genetic algorithm to solve a single machine scheduling problem with setup-times

Youssef Harrath, Amine Mahjoub and Jihene Kaabi

International Journal of Services and Operations Management, 2019, vol. 33, issue 4, 494-511

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.

Keywords: scheduling; completion time; total weighted tardiness; genetic algorithm; multi-objective optimisation. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101589 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:33:y:2019:i:4:p:494-511

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().