@article{MTMT:32761469, title = {A general framework for evaluating driver schedules in public transport}, url = {https://m2.mtmt.hu/api/publication/32761469}, author = {Balogh, János and Dávid, Balázs and Krész, Miklós and Tóth, Attila and Tóth, László}, doi = {10.20858/tp.2022.17.1.14}, journal-iso = {TRANSP PROBL / PROBLEMY TRANSPORTU / INT SCI J}, journal = {TRANSPORT PROBLEMS / PROBLEMY TRANSPORTU: INTERNATIONAL SCIENTIFIC JOURNAL}, volume = {17}, unique-id = {32761469}, issn = {1896-0596}, year = {2022}, eissn = {2300-861X}, pages = {163-174}, orcid-numbers = {Tóth, Attila/0000-0003-1014-7965} } @article{MTMT:32737705, title = {A divide and combine method for machine configuration and workload balancing problem in multiple product PCB assembly}, url = {https://m2.mtmt.hu/api/publication/32737705}, author = {Tóth, Attila and Knuutila, Timo and Nevalainen, Olli S.}, doi = {10.1007/s00170-022-08819-8}, journal-iso = {INT J ADV MANUFACT TECHNOL}, journal = {INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY}, volume = {120}, unique-id = {32737705}, issn = {0268-3768}, year = {2022}, eissn = {1433-3015}, pages = {4079-4095}, orcid-numbers = {Tóth, Attila/0000-0003-1014-7965} } @article{MTMT:31629656, title = {Graph Coloring based Heuristic for Crew Rostering}, url = {https://m2.mtmt.hu/api/publication/31629656}, author = {Hajdu, László and Tóth, Attila and Krész, Miklós}, doi = {10.14232/actacyb.281106}, journal-iso = {ACTA CYBERN-SZEGED}, journal = {ACTA CYBERNETICA}, volume = {24}, unique-id = {31629656}, issn = {0324-721X}, abstract = {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.}, year = {2020}, eissn = {2676-993X}, pages = {643-661}, orcid-numbers = {Hajdu, László/0000-0002-1832-6944; Tóth, Attila/0000-0003-1014-7965; Krész, Miklós/0000-0002-7547-1128} } @{MTMT:30926561, title = {Lower bound definition for working time in crew scheduling problem}, url = {https://m2.mtmt.hu/api/publication/30926561}, author = {Tóth, Attila and Krész, Miklós}, booktitle = {Abstract book for the 15th Miklós Iványi International PhD & DLA Symposium}, unique-id = {30926561}, year = {2019}, orcid-numbers = {Tóth, Attila/0000-0003-1014-7965} } @inproceedings{MTMT:30419831, title = {A framework for defining scheduling problems}, url = {https://m2.mtmt.hu/api/publication/30419831}, author = {Tóth, Attila and Krész, Miklós}, booktitle = {VOCAL 2018. 8th VOCAL Optimization Conference: Advanced Algorithms}, unique-id = {30419831}, year = {2018}, pages = {108-114}, orcid-numbers = {Tóth, Attila/0000-0003-1014-7965} } @article{MTMT:3350991, title = {Machine configuration and workload balancing of modular placement machines in multi-product PCB assembly}, url = {https://m2.mtmt.hu/api/publication/3350991}, author = {Tóth, Attila and Knuutila, Timo and Nevalainen, Olli S}, doi = {10.1080/0951192X.2018.1429667}, journal-iso = {INT J COMPUT INTEG M}, journal = {INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING}, volume = {31}, unique-id = {3350991}, issn = {0951-192X}, abstract = {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.}, keywords = {GENETIC ALGORITHM; integer programing; Printed Circuit Board; modular machines; machine configuration; mixed-model workload balancing}, year = {2018}, eissn = {1362-3052}, pages = {815-830}, orcid-numbers = {Tóth, Attila/0000-0003-1014-7965} } @book{MTMT:3276466, title = {Modern informatikai eszközök használata a sportinformatikában}, url = {https://m2.mtmt.hu/api/publication/3276466}, isbn = {9789633064429}, author = {Annus, Gábor and Balogh, János and Békési, József and Dávid, Balázs and Krnács, András and Tóth, Attila}, publisher = {SZTE JGYPK}, unique-id = {3276466}, year = {2015}, orcid-numbers = {Tóth, Attila/0000-0003-1014-7965} } @{MTMT:2885245, title = {Graph coloring based heuristic for driver rostering}, url = {https://m2.mtmt.hu/api/publication/2885245}, author = {Hajdu, László and Krész, Miklós and Tóth, Attila}, booktitle = {Proceedings of the 2014 1st Student Computer Science Research Conference}, unique-id = {2885245}, year = {2014}, pages = {9-12}, orcid-numbers = {Tóth, Attila/0000-0003-1014-7965} } @inproceedings{MTMT:2880537, title = {The basic problem of vehicle scheduling can be solved by maximum bipartite matching. Vol. 2.}, url = {https://m2.mtmt.hu/api/publication/2880537}, author = {Árgilán, Viktor Sándor and Balogh, János and Tóth, Attila}, booktitle = {ICAI 2014: Proceedings of the 9th International Conference on Applied Informatics, vol. 1-2}, doi = {10.14794/ICAI.9.2014.2.209}, unique-id = {2880537}, year = {2014}, pages = {209-218}, orcid-numbers = {Tóth, Attila/0000-0003-1014-7965} } @article{MTMT:2532007, title = {Ütemezési feladatok az autóbuszos közösségi közlekedés operatív tervezésében: Egy áttekintés}, url = {https://m2.mtmt.hu/api/publication/2532007}, author = {Árgilán, Viktor Sándor and Balogh, János and Békési, József and Dávid, Balázs and Galambos, Gábor and Krész, Miklós and Tóth, Attila}, journal-iso = {ALK MAT LAP}, journal = {ALKALMAZOTT MATEMATIKAI LAPOK}, volume = {31}, unique-id = {2532007}, issn = {0133-3399}, year = {2014}, pages = {1-40}, orcid-numbers = {Tóth, Attila/0000-0003-1014-7965} }