Modeling and algorithmic development of a staff scheduling problem |
| |
| Institution: | 1. Instituto de Aplicação Fernando Rodrigues da Silveira, Universidade do Estado do Rio de Janeiro, Rua Santa Alexandrina 288, 20261-232, Rio de Janeiro, RJ, Brazil;2. Faculdade de Tecnologia, Universidade do Estado do Rio de Janeiro, Rod. Presidente Dutra Km 298, Pólo Industrial, 27537-000, Resende, RJ, Brazil;3. Centro Universitário de Volta Redonda, UniFOA, Avenida Paulo Erlei Alves Abrantes 1325, 27240-560, Volta Redonda, RJ, Brazil;1. Transparent Ceramics Research Center, Shanghai Institute of Ceramics, Chinese Academy of Sciences, Shanghai 200050, China;2. School of Material Sciences & Engineering, Shanghai University, Shanghai 200436, China;3. STC “Institute for Single Crystals”, NAS of Ukraine, Kharkov 61001, Ukraine;4. Institute of Electrophysics, Ural Branch of Russian Academy of Sciences, Ekaterinburg 620016, Russia;5. Shanghai Key Laboratory of Crime Scene Evidence, Shanghai Research Institute of Criminal Science and Technology, Shanghai 200083, China;6. Department of Physics, Shanghai Normal University, Shanghai 200234, China;1. Mathematisches Institut, Universität Jena, Ernst-Abbe-Platz 2, 07743 Jena, Germany;2. Department of Computer Science, Columbia University, New York, NY 10027, USA;3. Institute of Applied Mathematics, University of Warsaw, ul. Banacha 2, 02-097 Warszawa, Poland;1. Lomonosov Moscow State University, Belozersky Institute of Physico-Chemical Biology, Moscow 119234, Russia;2. FGBU Hematology Research Centre, Russia Federation Ministry of Public Health, Moscow 125167, Russia;3. Gamaleya Research Institute of Epidemiology and Microbiology, Moscow 123098, Russia |
| |
| Abstract: | The problem of scheduling workers at a hub of a trucking system for the stripping and loading of the trucks and the determination of the optimal number of workers is a difficult problem. The trucks arrive at the facility at different (but known) times and may have their own scheduled departure times. This problem is like a set partitioning problem but with a side constraint pertaining to the dynamic arrival of the trucks. We develop a procedure to solve this problem that is based on the column generation technique, and the solution of a set covering problem to obtain the integer solution. The performance of the procedure is demonstrated by applying it to the real-life data obtained from a trucking company. Its effectiveness is illustrated by comparing it with a lower bound and a well-known heuristic procedure. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
