A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness

dc.contributor.author	Schaller,J	en
dc.contributor.author	Jorge Valente	en
dc.date.accessioned	2017-12-26T14:52:32Z
dc.date.available	2017-12-26T14:52:32Z
dc.date.issued	2013	en
dc.description.abstract	This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimising total earliness and tardiness. A genetic algorithm is proposed for the problem. This procedure and five other procedures were tested on problem sets that varied in terms of number of jobs, machines and the tightness and range of due dates. It was found that the genetic algorithm procedure was consistently effective in generating good solutions relative to the other procedures.	en
dc.identifier.uri	http://repositorio.inesctec.pt/handle/123456789/4957
dc.identifier.uri	http://dx.doi.org/10.1080/00207543.2012.663945	en
dc.language	eng	en
dc.relation	5815	en
dc.rights	info:eu-repo/semantics/openAccess	en
dc.title	A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness	en
dc.type	article	en
dc.type	Publication	en

Now showing 1 - 1 of 1