A comparison of methods for determining performance based employee deployment in production systems

Abstract

Employee deployment is a crucial process in production systems. Based on qualification and individual performance of employees, deployment decisions can lead to ambiguous outcomes. This paper first reviews the state of the art and further compares two methods based on combinatorial analysis for employee deployment. Therefore, this paper emphasizes the costs and benefits of a Brute Force and an alternative Greedy method. When considering the qualification and individual performance of each employee, both algorithms provide working solutions. In direct comparison, the outcome of the alternative Greedy algorithm is more efficient in terms of calculation time whereas the Brute Force method provides the combination with the global optimum. This means calculation time as well as quality of outcome differ. The exponential growth of employee allocation possibilities depends on the amount of employees and leads to high calculation times, when using a Brute Force method. The comparison of both methods reveal that the proposed alternative Greedy algorithm reaches nearly as high outcomes as the Brute Force does, with significantly less calculation time. Furthermore, this paper offers an insight into the impact of deployment decisions within production systems.

SLR Systematic Literature Review: Metode Penilaian Kinerja Karyawan Menggunakan Human Performance Technology

“…Metode Penelitian terkait Pada tinjauan literatur yang sudah dilakukan terdapat metode yang digunakan untuk mengevaluasi keefektifan metode penilaian kinerja karyawan. Seperti pada penelitian sebelumnya yang dilakukan oleh [23]dengan membahas topik perbandingan metode untuk menentukan penempatan karyawan berdasarkan kinerja menggunakan optimization algorithm sebagai metode untuk evaluasi untuk metode penilaian kinerja brute force algorithm dan alternative greedy algorithm. Kemudian pada penelitian yang dilakukan oleh [28] menggunakan metode fuzzy comprehensive sebagai metode evaluasi untuk metode penilaian kinerja hill climbing, decision support model.…”

Sustainable Team Design: A Challenge to Traditional Beliefs in Information-Intensive Service Industries

“…Viability refers to the willingness to continue to work together by the individuals in the team [28]. Performance, on the other hand, is more difficult to conceptualize [29,30], as it is constrained by the quality of the measures used to assess teams. Cohen and Bailey [31] for example, assess team effectiveness using task, group, organization design factors, environmental factors, internal processes, external processes, and group psycho-social traits.…”

Brute Exhaustive Optimization of Intelligent Small Weighted Voting Ensembles in 1EXP(-)Z+ Initial-Term based Arithmetic Sequence’s Multi Precision Search Spaces

“…However, although both the stochastic population-based evolutionary and greedybased search heuristic procedures are often more efficient than brute exhaustive search, they may sometimes not guarantee to achieve of global optimum [6,7], whereas greedy and its variant implementation, such as the greedy randomized adaptive search which have been used by (8) may face a hill climbing problem, the evolutionary extremums may be caused by its population-based stochastic search heuristic implementation which may probabilistically select at that one time from a very unfit initialized genes chromosomes of the creature being optimized [9], among other things. As such, as observed in [10], the surprising outstanding successes of the systematic brute force-based exhaustive search counterpart in producing optimal WVE models configuration sets with predictive performances similar to those created by evolutionary-based optimization procedures in conjunction with its theoretical guarantee for finding an optimal solution through a search across systematic search spaces [11], it may become imperative to implement the brute exhaustive search procedures, as given the required high computational effort is available, it guarantees exhaustion of all candidate solutions combinations [11,12], for optimality search problems, such as this of finding the appropriate weights for the most accurate WVE, at a reasonable efficiency tradeoff when the deemed global optima solution estimations has been defined as a key requirement, that is, must occur.…”