Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 5

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  assignment problem
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Publication available in full text mode
Content available

Some Aspects of the Application of Genetic Algorithm for Solving the Assignment Problem of Tasks to Resources in a Transport Company

100%
Izdebski M., Jacyna M.
Logistics and Transport
|
2014
|
vol. 21
13-20
EN
The article defines the assignment problem of tasks to resources in a transport company. The paper describes mathematical model of a transport system taking into account the assignment of vehicles to the tasks. It also provides stages of creation of the genetic algorithm for solving the assignment problem in the transport company.
2
Publication available in full text mode
Content available

Factors affecting the result of matches in the one day format of cricket

100%
BANDULASIRI A., BROWN T., WICKRAMASINGHE I.
Operations Research and Decisions
|
2016
|
vol. 26
|
issue 4
21-32
EN
Factors contributing to winning games are imperative, as the ultimate objective in a game is victory. The aim of this study was to identify the factors that characterize the game of cricket, and to investigate the factors that truly influence the result of a game using the data collected from the Champions Trophy cricket tournament. According to the results, this cricket tournament can be characterized using the factors of batting, bowling, and decision-making. Further investigation suggests that the rank of the team and the number of runs they score have the most significant influence on the result of games. As far as the effectiveness of assigning bowlers is concerned, the Australian team has done a fabulous job compared to the rest of the teams.
3
Publication available in full text mode
Content available

The SEKO assignment. Efficient and fair assignment of students to multiple seminars

63%
HOßFELD T.
Operations Research and Decisions
|
2023
|
vol. 33
|
issue 3
1-27
EN
Seminars are offered to students for education in various disciplines. The seminars may be limited in terms of the maximum number of participants, e.g., to have lively interactions. Due to capacity limitations, those seminars are often offered several times to serve the students’ demands. Still, some seminars are more popular than others and it may not be possible to grant access to all interested students due to capacity limitations. In this paper, a simple, but efficient random selection using key objectives (SEKO) assignment strategy is proposed which achieves the following goals: (i) efficiency by utilizing all available seminar places, (ii) satisfying all students by trying to assign at least one seminar to each student, and (iii) fairness by considering the number of assigned seminars per student. We formulate various theoretical optimization models using integer linear programming (ILP) and compare their solutions to the SEKO assignment based on a real-world data set. The real-world data set is also used as the basis for generating large data sets to investigate the scalability in terms of demand and number of seminars. Furthermore, the first-in first-out (FIFO) assignment, as a typical implementation of fair assignments in practice, is compared to SEKO in terms of utilization and fairness. The results show that the FIFO assignment suffers in real world situations regarding fairness, while the SEKO assignment is close to the optimum and scales regarding computational time in contrast to the ILP.
4
Publication available in full text mode
Content available

Optymalizacja przypisania zadania za pomocą liniowego narzędzia programującego PESBAT

51%
Yanch U., Wiechetek Ł.
Annales Universitatis Mariae Curie-Skłodowska, sectio H – Oeconomia
|
2018
|
vol. 52
|
issue 2
EN
The article presents task assignment problem and the role that modern linear programming tools may play in its solving. Task assignment problem is a case of the assignment problem, which is one of the fundamental combinatorial optimization problems. Its specific formulations can be found in logistics (e.g. driver assignment problem), computer science (e.g. memory management) and other fields of science and business. Various methods and algorithms have been created or adapted to solve the assignment problem, and modern linear programming and optimization tools like Microsoft Excel Solver, which contain implementations of these algorithms, provide a possibility to solve diverse cases of the assignment problem with minimum effort and time.The article addresses widely known task assignment problem in business, its sources and ways of solving or reducing its negative impact on business processes effectiveness. The paper contains also a general overview of modern linear programming tools that can be used for task assignment and describes Microsoft Excel Solver Add-in as a tool for business process optimization.The main part of the article is a presentation of VBA based optimization tool called PESBAT developed by the authors and the case of task assignment process optimization in the enterprise that offers photoanalytical services. Pilot use of a PESBAT tool showed that it allows reducing the time needed for task assignment, gives more balanced workload for employees but also indicated the optimization possibilities of other areas of described company, like route optimization and reports preparation.
PL
W artykule przedstawiono problem przypisywania zadań oraz rolę, jaką mogą odegrać w ich rozwiązywaniu nowoczesne narzędzia programowania liniowego. Problem przydziału zadań jest przypadkiem problemu przypisania, będącym jednym z podstawowych problemów optymalizacji kombinatorycznej. Jego specyficzne sformułowania można znaleźć w logistyce (np. problem przypisywania sterowników), informatyce (np. w zarządzaniu pamięcią) oraz innych dziedzinach nauki i biznesu. Opracowano lub zaadaptowano różne metody i algorytmy, aby rozwiązać problem przydziału, a nowoczesne narzędzia do programowania i optymalizacji liniowej, takie jak Microsoft Excel Solver, które zawierają implementację tych algorytmów, zapewniają możliwość rozwiązywania różnorodnych przypadków problemu przydziału przy minimalnym wysiłku i czasie.W opracowaniu szeroko omówiono znany problem przypisywania zadań w biznesie, jego źródła i sposoby rozwiązywania lub ograniczania jego negatywnego wpływu na efektywność procesów biznesowych. Praca zawiera również ogólny przegląd nowoczesnych narzędzi programowania liniowego, które można wykorzystać do przypisania zadań. Ponadto autorzy opisali dodatek Microsoft Solver Add-in jako narzędzie do optymalizacji procesów biznesowych.Główną częścią artykułu jest prezentacja opracowanego przez autorów narzędzia optymalizacyjnego VBA o nazwie PESBAT oraz przypadku optymalizacji procesu przydzielania zleceń w przedsiębiorstwie, które oferuje usługi fotoanalityczne. Pilotażowe wykorzystanie narzędzia PESBAT pokazało, że pozwala ono na skrócenie czasu potrzebnego na przypisanie zadań, zapewnia bardziej zrównoważony nakład pracy dla pracowników, ale także wskazało możliwości optymalizacji innych obszarów opisywanej firmy, takie jak optymalizacja trasy i przygotowanie raportów.
5
Publication available in full text mode
Content available

The SEKO assignment : efficient and fair assignment of students to multiple seminars

51%
Hoßfeld T.
Operations Research and Decisions
|
2023
|
vol. 33
|
issue 3
EN
Seminars are offered to students for education in various disciplines. The seminars may be limited in terms of the maximum number of participants, e.g., to have lively interactions. Due to capacity limitations, those seminars are often offered several times to serve the students’ demands. Still, some seminars are more popular than others and it may not be possible to grant access to all interested students due to capacity limitations. In this paper, a simple, but efficient random selection using key objectives (SEKO) assignment strategy is proposed which achieves the following goals: (i) efficiency by utilizing all available seminar places, (ii) satisfying all students by trying to assign at least one seminar to each student, and (iii) fairness by considering the number of assigned seminars per student. We formulate various theoretical optimization models using integer linear programming (ILP) and compare their solutions to the SEKO assignment based on a real-world data set. The real-world data set is also used as the basis for generating large data sets to investigate the scalability in terms of demand and number of seminars. Furthermore, the first-in first-out (FIFO) assignment, as a typical implementation of fair assignments in practice, is compared to SEKO in terms of utilization and fairness. The results show that the FIFO assignment suffers in realworld situations regarding fairness, while the SEKO assignment is close to the optimum and scales regarding computational time in contrast to the ILP.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.