Name
Title | ||
|---|---|---|
Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.endm.2010.05.060 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Common due date,Single Scheduling,Dynamic Programming,Genetic algorithm,Earliness-tardiness penalties | Dynamic programming,Population,Mathematical optimization,Single-machine scheduling,Tardiness,Goodwill,Dynamic priority scheduling,Inventory cost,Mathematics,Genetic algorithm | Journal |
Volume | ISSN | Citations |
36 | 1571-0653 | 4 |
PageRank | References | Authors |
0.41 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hemmak Allaoua | 1 | 4 | 0.41 |
| Ibrahim H. Osman | 2 | 815 | 94.23 |