LIVE DEMO

Native Scheduler: from home visits to dance competitions

Watch six scheduling problems solved: visits with travel and double-ups, dancers who need fifteen minutes to change, operations that need three people and a room at once, exams by seats, paint lines with changeovers, and a re-plan when someone calls in sick.

Native Scheduler: from home visits to dance competitions: Watch six scheduling problems solved: visits with travel and double-ups, dancers who need fifteen minutes to change, operations that need three people and a room at once, exams by seats, paint lines with changeovers, and a re-plan when someone calls in sick.

This interactive demo needs WebGL. Read about it.

Native Scheduler: from home visits to dance competitionsOpen the full demo →

What you are looking at

From version 1.7.0, Galactus DB schedules work inside the database with gdb.schedule.solve. Each row in the scene is a timeline: a person, a stage, a theatre or a production line that can only be in so many places at once. Columns are time. Six problems, one engine:

Each chapter shows the greedy seed placing the hardest tasks first, then large neighbourhood search taking groups of tasks out and putting them back better. Amber marks the gap each row needs between tasks: travel, a costume change, cleaning or a changeover.

All data is synthetic: the names are invented and the maps are abstract.

Things to try

Learn more