Retail business staff scheduling under complex labor relations

Arbeitspapier

The staff scheduling problem in the retail business is considered for which a new mathematical model and new solution methods are introduced. The problem is formalized as a set covering type problem. Columns represent feasible weekly working time patterns of one sales clerk. Rows correspond to periods derived from the weekly opening time. For each period the number of required sales clerks is given. Based on the complex labor rules in Germany a graph is constructed in such a way that a path through the graph represents a weekly working time pattern. A feasible weekly working time pattern is generated by solving a restricted minimum cost path problem in the graph. Different approaches are introduced to compute lower and upper bounds. In particular, a new upper bounding method is presented in which dual variables are defined heuristically. The different approaches are compared by a numerical investigation.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 511

Classification and Topics

• Classification: Management
• Subject: Retail business management ; shift/days off/tour scheduling ; column generation ; restricted shortest path problem ; heuristic pricing ; Einzelhandel ; Verkaufspersonal ; Personaleinsatzplanung ; Scheduling-Verfahren ; Arbeitsrecht ; Arbeitszeitgestaltung ; Theorie ; Deutschland

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Haase, Knut
• Event: Veröffentlichung
• (who): Universität Kiel, Institut für Betriebswirtschaftslehre ; ZBW – Leibniz Information Centre for Economics
• (where): Kiel
• (when): 1999

Further information

• Handle: http://hdl.handle.net/10419/147598
• Last update: 10.03.2025, 11:44 AM CET