On binary representations for biometric template protection

C. Chen

    Research output: ThesisPhD Thesis - Research UT, graduation UT

    187 Downloads (Pure)


    We treat the problem of generating cost-optimal schedules for orders with individual due dates and cost functions based on earliness/tardiness. Orders can run in parallel in a resource-constrained manufacturing environment, where resources are subject to stochastic breakdowns. The goal is to generate schedules while minimizing the expected costs. First, we estimate the distribution of each order type by simulation (assuming a reasonable machine/load model) and derive from the cost-function an optimal offset from the due date of each individual order. Second, these optimal offsets are then used to guide the generation of schedules which are responsible to resolve resource conflicts. Third, we evaluate the generated schedules by simulation. The approach is demonstrated by means of a non-trivial case-study from lacquer production. Optimal offsets are derived with the Modest/Mobius tool, schedules are generated using UPPAAL CORA. The experimental results show that our approach achieves good results in all considered scenarios, and better results than an approach based on adding slack to processing times.
    Original languageEnglish
    QualificationDoctor of Philosophy
    Awarding Institution
    • University of Twente
    • Slump, Cornelis H., Supervisor
    • Veldhuis, Raymond N.J., Advisor
    Thesis sponsors
    Award date7 Dec 2011
    Place of PublicationEnschede
    Print ISBNs978-90-365-3339-3
    Publication statusPublished - 7 Dec 2011


    • Biometrics
    • Biometric Template Protection
    • EWI-21528
    • METIS-285138
    • IR-79741

    Cite this