Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date

Autor:	Ibrahim Osmane, Hemmak Allaoua
Rok vydání:	2010
Předmět:	Schedule education.field_of_study Mathematical optimization Single-machine scheduling Applied Mathematics Tardiness Population Dynamic priority scheduling Dynamic programming Chromosome (genetic algorithm) Genetic algorithm Discrete Mathematics and Combinatorics education Mathematics
Zdroj:	Electronic Notes in Discrete Mathematics. 36:471-478
ISSN:	1571-0653
DOI:	10.1016/j.endm.2010.05.060
Popis:	Modern manufacturing philosophy of just-in-time emphasizes that a job should be completed as close as possible to its due date to avoid inventory cost and loss of customers goodwill. In this paper, the single machine scheduling problem with a common due date, where the objective is to minimize the total earliness and tardiness penalties in the schedule of jobs, is considered. A new genetic algorithm inspired by the philosophy of dynamic programming, where the chromosome and the population lengths are varied from one iteration to another, is proposed.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::546fbe2fbbb252a8ee611182cb89a875 https://doi.org/10.1016/j.endm.2010.05.060 Zobrazit plný text záznamu Full Text from ScienceDirect