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.
|Name||CTIT Technical Report Series|
- cyclic scheduling
- METIST (Advanced Methods for Timed Systems)