Attila Tóth
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Attila Tóth has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Miklós Krész
University of Szeged
4 shared publications - János Balogh
University of Szeged, Szeged, Hungary
2 shared publications Olli S. Nevalainen
2 shared publicationsTimo Knuutila
2 shared publicationsBalázs Dávid
Univ Primorska, Glagoljaska 8, SI-6000 Koper, Slovenia
1 shared publication- Balázs Dávid
InnoRenew CoE, Andrej Marušič Institute and Faculty of Mathematics, Natural Sciences and Information Technologies, University of Primorska, 6000 Koper, Slovenia
1 shared publication
Latest Publications
- 12 March 2022
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 120 (5-6) , 4079-4095
A divide and combine method for machine configuration and workload balancing problem in multiple product PCB assembly
- 12 March 2022
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 120 (5-6) , 4079-4095
A divide and combine method for machine configuration and workload balancing problem in multiple product PCB assembly
- 1 March 2022
- Published by Silesian University of Technology in Transport Problems
- Vol. 17 (1) , 163-174
A GENERAL FRAMEWORK FOR EVALUATING DRIVER SCHEDULES IN PUBLIC TRANSPORT
- 1 March 2022
- Published by Silesian University of Technology in Transport Problems
- Vol. 17 (1) , 163-174
A GENERAL FRAMEWORK FOR EVALUATING DRIVER SCHEDULES IN PUBLIC TRANSPORT
- 19 August 2020
- Published by University of Szeged in Acta Cybernetica
- Vol. 24 (4) , 643-661
Graph Coloring based Heuristic for Crew Rostering
In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.
- 19 August 2020
- Published by University of Szeged in Acta Cybernetica
- Vol. 24 (4) , 643-661
Graph Coloring based Heuristic for Crew Rostering
In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.
- Open Access
- 24 January 2018
- Published by Taylor & Francis in International Journal of Computer Integrated Manufacturing
- Vol. 31 (9) , 815-830
Machine configuration and workload balancing of modular placement machines in multi-product PCB assembly
A popular gantry-type placement machine includes several interconnected, autonomously operating component placement modules and the machine was designed so as to able to use different kinds of placement heads and vacuum nozzles in the modules, which can be easily changed. Although this increases the flexibility of the production line, the reconfiguration phases of the modules may be unproductive and one should keep them to a minimum. In addition, the production times can be shortened by balancing the workloads of the machine modules. Here, a two-step optimisation method for the machine reconfiguration and workload balancing in the case of multiple Printed Circuit Borad (PCB) batches of different sizes and PCB types is presented. The objective is to minimise the total production time, and keep the machine configuration the same for all batches. The proposed algorithm is iterative and it applies integer programming for the workload balancing along with an evolutionary algorithm that searches for the best machine configuration. In experiments, for single PCB types the proposed algorithm obtained optimal or near optimal solutions. For multiple PCB types the solutions favour the PCB types that have a bigger production time due to greater batch sizes, but the total production time is still close to optimal.
- 24 January 2018
- Published by Taylor & Francis in International Journal of Computer Integrated Manufacturing
- Vol. 31 (9) , 815-830
Open AccessMachine configuration and workload balancing of modular placement machines in multi-product PCB assembly
A popular gantry-type placement machine includes several interconnected, autonomously operating component placement modules and the machine was designed so as to able to use different kinds of placement heads and vacuum nozzles in the modules, which can be easily changed. Although this increases the flexibility of the production line, the reconfiguration phases of the modules may be unproductive and one should keep them to a minimum. In addition, the production times can be shortened by balancing the workloads of the machine modules. Here, a two-step optimisation method for the machine reconfiguration and workload balancing in the case of multiple Printed Circuit Borad (PCB) batches of different sizes and PCB types is presented. The objective is to minimise the total production time, and keep the machine configuration the same for all batches. The proposed algorithm is iterative and it applies integer programming for the workload balancing along with an evolutionary algorithm that searches for the best machine configuration. In experiments, for single PCB types the proposed algorithm obtained optimal or near optimal solutions. For multiple PCB types the solutions favour the PCB types that have a bigger production time due to greater batch sizes, but the total production time is still close to optimal.
- 26 October 2012
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 21 (S1) , 75-94
An efficient solution approach for real-world driver scheduling problems in urban bus transportation
- 26 October 2012
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 21 (S1) , 75-94
An efficient solution approach for real-world driver scheduling problems in urban bus transportation
- 14 April 2012
- Published by Springer Nature
- p. 323-328
Driver scheduling based on “driver-friendly” vehicle schedules
- 14 April 2012
- Published by Springer Nature
- p. 323-328
Driver scheduling based on “driver-friendly” vehicle schedules