Return to search

Optimalizace rozvrhu směnného provozu: aplikace v řetězcích rychlého občerstvení / Crew Scheduling Problem: Application in Fast Food Chains

Crew scheduling is very important, especially in continuous operating environments running 24 hours a day, 7 days a week, more so if the demand for staff is varying over each hour of the day. This thesis focuses on staff optimization in a fast food chain where special conditions for scheduling like flexible starting-times and shift lengths or heterogeneous crew are present. Two new models based on a mixed integer programming approach were designed, dealing with data from a particular restaurant with the aim of improving schedules and saving time spent on the creation of those schedules. At the end of the thesis the empiric schedules and results obtained are compared and the computational efficiency of both models is discussed.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:124620
Date January 2011
CreatorsHavlová, Irena
ContributorsZouhar, Jan, Kořenář, Václav
PublisherVysoká škola ekonomická v Praze
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0021 seconds