The present thesis shows the manner of distributing workers on shifts with regular work load but uneven work schedules. It is generally known as the covering or set-covering problem. The present paper describes a way to solve it with mathematical modelling and programs for possible planning of workers on shifts. The issue is documented on a case of an existing company.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:72258 |
| Date | January 2011 |
| Creators | Valná, Hana |
| Contributors | Kalčevová, Jana, Zouhar, Jan |
| Publisher | Vysoká škola ekonomická v Praze |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0021 seconds