A comparison of two V-shaped schedule-builder EAs for the common due date problem
The restricted single-machine common due date problem can be stated as follows: A set of <i>n</i> jobs with deterministic processing times <i>p</i><SUB>i</SUB> and a common due date <i>d</i> are given. The jobs have to be processed on one machine. For...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21648 |
| Aporte de: |
| id |
I19-R120-10915-21648 |
|---|---|
| record_format |
dspace |
| institution |
Universidad Nacional de La Plata |
| institution_str |
I-19 |
| repository_str |
R-120 |
| collection |
SEDICI (UNLP) |
| language |
Inglés |
| topic |
Ciencias Informáticas ARTIFICIAL INTELLIGENCE two v-shaped schedule-builder eas common due date problem |
| spellingShingle |
Ciencias Informáticas ARTIFICIAL INTELLIGENCE two v-shaped schedule-builder eas common due date problem Pandolfi, Daniel Vilanova, Gabriela San Pedro, María Eugenia de Villagra, Andrea Gallard, Raúl Hector A comparison of two V-shaped schedule-builder EAs for the common due date problem |
| topic_facet |
Ciencias Informáticas ARTIFICIAL INTELLIGENCE two v-shaped schedule-builder eas common due date problem |
| description |
The restricted single-machine common due date problem can be stated as follows: A set of <i>n</i> jobs with deterministic processing times <i>p</i><SUB>i</SUB> and a common due date <i>d</i> are given. The jobs have to be processed on one machine. For each of the jobs an individual earliness α<SUB>i</SUB> and tardiness β<SUB>i</SUB> penalty is given, which is incurred, if a job is finished before or after the common due date <i>d</i>, respectively. The goal is to find a schedule for the <i>n</i> jobs which jointly minimizes the sum of earliness and tardiness penalties. Even simple in the formulation, this model leads to an optimization problem that is NP-Hard. |
| format |
Objeto de conferencia Objeto de conferencia |
| author |
Pandolfi, Daniel Vilanova, Gabriela San Pedro, María Eugenia de Villagra, Andrea Gallard, Raúl Hector |
| author_facet |
Pandolfi, Daniel Vilanova, Gabriela San Pedro, María Eugenia de Villagra, Andrea Gallard, Raúl Hector |
| author_sort |
Pandolfi, Daniel |
| title |
A comparison of two V-shaped schedule-builder EAs for the common due date problem |
| title_short |
A comparison of two V-shaped schedule-builder EAs for the common due date problem |
| title_full |
A comparison of two V-shaped schedule-builder EAs for the common due date problem |
| title_fullStr |
A comparison of two V-shaped schedule-builder EAs for the common due date problem |
| title_full_unstemmed |
A comparison of two V-shaped schedule-builder EAs for the common due date problem |
| title_sort |
comparison of two v-shaped schedule-builder eas for the common due date problem |
| publishDate |
2001 |
| url |
http://sedici.unlp.edu.ar/handle/10915/21648 |
| work_keys_str_mv |
AT pandolfidaniel acomparisonoftwovshapedschedulebuildereasforthecommonduedateproblem AT vilanovagabriela acomparisonoftwovshapedschedulebuildereasforthecommonduedateproblem AT sanpedromariaeugeniade acomparisonoftwovshapedschedulebuildereasforthecommonduedateproblem AT villagraandrea acomparisonoftwovshapedschedulebuildereasforthecommonduedateproblem AT gallardraulhector acomparisonoftwovshapedschedulebuildereasforthecommonduedateproblem AT pandolfidaniel comparisonoftwovshapedschedulebuildereasforthecommonduedateproblem AT vilanovagabriela comparisonoftwovshapedschedulebuildereasforthecommonduedateproblem AT sanpedromariaeugeniade comparisonoftwovshapedschedulebuildereasforthecommonduedateproblem AT villagraandrea comparisonoftwovshapedschedulebuildereasforthecommonduedateproblem AT gallardraulhector comparisonoftwovshapedschedulebuildereasforthecommonduedateproblem |
| bdutipo_str |
Repositorios |
| _version_ |
1764820464775987200 |