Finding the Perfect Shift Schedule

Shung-Hsi Yu

Shung-Hsi Yu

Kernel Engineer at SUSE working on BPF

    摘要

    Finding a working shift schedule can be a tedious task, there’s usually various requirements to juggle all at once, from time-offs, shift types, conflicting schedules, to personal preferences; and one may easily miss a requirement or two by mistake. Instead, we can use so called “solvers” and leave the hard lifting up to computer to find not just a valid schedule, but a good one; and as it turns out, the same technique also works for a broad spectrum of problems such as conference scheduling, vehicle routing, bin packing, and more.

    說明

    影片

    地點

    R2

    時間

    第一天 • 12:55-13:25 (GMT+8)

    語言

    英文演講

    層級

    中階

    分類

    應用