dc.contributor.author | Krump, Štěpán | |
dc.contributor.author | Graf, Vojtěch | |
dc.contributor.author | Staněk, Pavel | |
dc.date.accessioned | 2024-01-24T07:10:40Z | |
dc.date.available | 2024-01-24T07:10:40Z | |
dc.date.issued | 2023 | |
dc.identifier.citation | MM Science Journal. 2023, vol. 2023, p. 6339-6345. | cs |
dc.identifier.issn | 1803-1269 | |
dc.identifier.issn | 1805-0476 | |
dc.identifier.uri | http://hdl.handle.net/10084/151950 | |
dc.description.abstract | Production and maintenance processes are inherent in the life
cycle of every product. Despite great efforts to automate these
processes, a great deal of human resources are still required,
which represent a significant part of the financial costs. Each
process is composed of sub-tasks that require certain specifics
in terms of the number of staff, their expertise, qualifications
and experience. It is assumed that the staff are divided
according to specifics into different groups with differing
wages. Workers' wages are reflected in the final financial cost
of the product, its life cycle and its return. Reducing labour
costs in a production or maintenance process can be achieved
by reducing the total number of staff deployed in the process
and by appropriately composing groups of workers. Reducing
labour costs leads to increased competitiveness in the market.
The main tools of competitiveness are price, speed and range
of services offered. This paper examines a strategy that uses
price as the main tool for competitiveness in the market. One
way to reduce the final price of the product for the customer
is to optimise the costs of human resources. This can be
achieved through appropriate planning of staff shifts.
The specifics of the deployment of staff in a production
or maintenance process depend on the requirements
of the process sub-tasks. This means that each group
of workers can only handle a certain group of tasks according
to their qualifications. A Binary Programming Problem with
Linear Bonds will be used to plan the deployment of staff,
aiming to minimize the number of workers needed
in a production or maintenance process within a predefined
timeframe. | cs |
dc.language.iso | en | cs |
dc.publisher | MM Science | cs |
dc.relation.ispartofseries | MM Science Journal | cs |
dc.relation.uri | https://doi.org/10.17973/MMSJ.2023_03_2022106 | cs |
dc.subject | maintenance | cs |
dc.subject | mathematical model | cs |
dc.subject | Binary Programming Problem | cs |
dc.subject | scheduling | cs |
dc.subject | crew members | cs |
dc.title | Optimization of workers quantity using mathematical model | cs |
dc.type | article | cs |
dc.identifier.doi | 10.17973/MMSJ.2023_03_2022106 | |
dc.rights.access | openAccess | cs |
dc.type.version | publishedVersion | cs |
dc.type.status | Peer-reviewed | cs |
dc.description.source | Web of Science | cs |
dc.description.volume | 2023 | cs |
dc.description.lastpage | 6345 | cs |
dc.description.firstpage | 6339 | cs |
dc.identifier.wos | 000991511800001 | |