Abstract
| Original language | Undefined |
|---|---|
| Place of Publication | Enschede |
| Publisher | University of Twente, Department of Applied Mathematics |
| Number of pages | 24 |
| ISBN (Print) | 0169-2690 |
| Publication status | Published - 2005 |
Publication series
| Name | Memorandum Afdeling TW |
|---|---|
| Publisher | Department of Applied Mathematics, University of Twente |
| No. | 1776 |
| ISSN (Print) | 0169-2690 |
Keywords
- MSC-68M20
- MSC-90B35
- IR-65960
- METIS-225434
- EWI-3596
Cite this
}
Two exponential neighborhoods for single machine scheduling. / Brueggemann, T.; Hurink, Johann L.
Enschede : University of Twente, Department of Applied Mathematics, 2005. 24 p. (Memorandum Afdeling TW; No. 1776).Research output: Book/Report › Report › Professional
TY - BOOK
T1 - Two exponential neighborhoods for single machine scheduling
AU - Brueggemann, T.
AU - Hurink, Johann L.
N1 - Imported from MEMORANDA
PY - 2005
Y1 - 2005
N2 - We study the problem of minimizing total completion time on a single machine with the presence of release dates. We present two different approaches leading to exponential neighborhoods in which the best improving neighbor can be determined in polynomial time. Furthermore, computational results are presented to get insight in the performance of the developed neighborhoods.
AB - We study the problem of minimizing total completion time on a single machine with the presence of release dates. We present two different approaches leading to exponential neighborhoods in which the best improving neighbor can be determined in polynomial time. Furthermore, computational results are presented to get insight in the performance of the developed neighborhoods.
KW - MSC-68M20
KW - MSC-90B35
KW - IR-65960
KW - METIS-225434
KW - EWI-3596
M3 - Report
SN - 0169-2690
T3 - Memorandum Afdeling TW
BT - Two exponential neighborhoods for single machine scheduling
PB - University of Twente, Department of Applied Mathematics
CY - Enschede
ER -