Abstract
| Original language | Undefined |
|---|---|
| Place of Publication | Enschede |
| Publisher | Centre for Telematics and Information Technology (CTIT) |
| Number of pages | 14 |
| Publication status | Published - Jan 2004 |
Publication series
| Name | CTIT Technical Report Series |
|---|---|
| No. | 04-01 |
| ISSN (Print) | 1381-3625 |
Keywords
- cyclic scheduling
- EWI-5800
- IR-48765
- METIST (Advanced Methods for Timed Systems)
- METIS-220492
Cite this
}
On Cyclic Plans for Scheduling a Smart Card Personalisation System. / Nieberg, T.
Enschede : Centre for Telematics and Information Technology (CTIT), 2004. 14 p. (CTIT Technical Report Series; No. 04-01).Research output: Book/Report › Report › Professional
TY - BOOK
T1 - On Cyclic Plans for Scheduling a Smart Card Personalisation System
AU - Nieberg, T.
N1 - Imported from CTIT
PY - 2004/1
Y1 - 2004/1
N2 - An industrial case study for scheduling the personalisation of smart cards is presented and analysed. Smart cards are personalised in several machines that are served by an underlying conveyor belt connecting these. As there are usually a very high number of smart cards to be personalised, the focus is on cyclic schedules and the goal is to obtain a plan with high throughput. By characterizing certain schedules by the number of cards and free slots on the conveyor belt per cycle, non-trivial bounds on the cycle-time, and thus on the throughput, can be provided. This is done by looking at certain special scheduling policies, and using techniques known as destructive bounding. Additionally, with respect to the case study, optimality is proven for the input instances provided.
AB - An industrial case study for scheduling the personalisation of smart cards is presented and analysed. Smart cards are personalised in several machines that are served by an underlying conveyor belt connecting these. As there are usually a very high number of smart cards to be personalised, the focus is on cyclic schedules and the goal is to obtain a plan with high throughput. By characterizing certain schedules by the number of cards and free slots on the conveyor belt per cycle, non-trivial bounds on the cycle-time, and thus on the throughput, can be provided. This is done by looking at certain special scheduling policies, and using techniques known as destructive bounding. Additionally, with respect to the case study, optimality is proven for the input instances provided.
KW - cyclic scheduling
KW - EWI-5800
KW - IR-48765
KW - METIST (Advanced Methods for Timed Systems)
KW - METIS-220492
M3 - Report
T3 - CTIT Technical Report Series
BT - On Cyclic Plans for Scheduling a Smart Card Personalisation System
PB - Centre for Telematics and Information Technology (CTIT)
CY - Enschede
ER -