TY - JOUR AU - Hegyháti, Máté AU - Holczinger, Tibor AU - Ősz, Olivér TI - Addressing storage time restrictions in the S-graph scheduling framework JF - OPTIMIZATION AND ENGINEERING J2 - OPTIM ENG VL - 22 PY - 2021 IS - 4 SP - 2679 EP - 2706 PG - 28 SN - 1389-4420 DO - 10.1007/s11081-020-09548-1 UR - https://m2.mtmt.hu/api/publication/31396097 ID - 31396097 N1 - Department of Information Technology, Széchenyi István University, Egyetem tér 1., Győr, 9026, Hungary Department of Applied Informatics, University of Pannonia, Zrínyi Miklós u. 18., Nagykanizsa, 8800, Hungary Cited By :1 Export Date: 18 November 2022 Correspondence Address: Holczinger, T.; Department of Applied Informatics, Zrínyi Miklós u. 18., Hungary; email: holczinger.tibor@uni-pen.hu LA - English DB - MTMT ER - TY - JOUR AU - Holczinger, Tibor AU - Ősz, Olivér AU - Hegyháti, Máté TI - Scheduling approach for on-site jobs of service providers JF - FLEXIBLE SERVICES AND MANUFACTURING JOURNAL J2 - FLEX SERV MANUFACT J VL - 32 PY - 2020 IS - 4 SP - 913 EP - 948 PG - 36 SN - 1936-6582 DO - 10.1007/s10696-019-09359-2 UR - https://m2.mtmt.hu/api/publication/30686995 ID - 30686995 N1 - Department of Applied Informatics, University of Pannonia, Zrínyi u. 18., Nagykanizsa, 8800, Hungary Department of Information Technology, Széchenyi István University, Egyetem tér 1., Győr, 9026, Hungary Cited By :2 Export Date: 18 November 2022 Correspondence Address: Holczinger, T.; Department of Applied Informatics, Zrínyi u. 18., Hungary; email: holczinger.tibor@uni-pen.hu AB - Nowadays the successful operation of a company is unimaginable without fast and reliable communication. As a result, so-called Communication Service Providers play an important role in today’s business life. Their orders have to be carried out promptly and dependably, let them be requests for new installations, modifications, or maintenance tasks. These orders have to be performed at different locations and they often have deadlines or strict starting times. Violating such a timing requirement usually implies penalties. In this paper, scheduling problems arising at a Hungarian service provider are examined. At this company, orders are decomposed into smaller tasks, which can be performed by specially trained personnel. Transportation of these specialists contributes a lot to the costs and to the complexity of their scheduling, as well. The goal is to minimize the overall cost of satisfying all orders within the given time horizon with the available assets of the company. The proposed approach relies on the S-graph framework, which has been applied to various production scheduling problems in the literature. In addition to an unambiguous and sound S-graph model of the examined problem, slight modifications of the scheduling algorithms for cost minimization, and new bounding methods have been developed. Several of such bounds have been provided and tested for performance and scalability over a large number of generated examples. The sensitivity of the approach for certain problem features has also been examined. LA - English DB - MTMT ER - TY - JOUR AU - Adonyi, R AU - Kirilova, EG AU - Vaklieva-Bancheva, NG TI - Systematic approach for designing and activities' scheduling of supply chain network JF - BULGARIAN CHEMICAL COMMUNICATIONS J2 - BULG CHEM COMMUN VL - 45 PY - 2013 IS - 3 SP - 288 EP - 295 PG - 8 SN - 0324-1130 UR - https://m2.mtmt.hu/api/publication/25379681 ID - 25379681 N1 - Megjegyzés-23533906 FN: Thomson Reuters Web of Knowledge LA - English DB - MTMT ER - TY - CONF AU - Jing, Yang AU - Yingwen, Pan TI - Analysis on Production Processe Optimization of Small-Mddle Float Glass Manufacturer. Shenmu Float Glass Manufacturer in Shaanxi Province as an Example TS - Shenmu Float Glass Manufacturer in Shaanxi Province as an Example T2 - 2nd International Conference on Information and Multimedia Technology (ICIMT 2010) PB - International Association of Computer Science and Information Technology Press (IACSIT) C1 - Singapore PB - International Association of Computer Science and Information Technology Press (IACSIT) PY - 2012 SP - 102 EP - 108 PG - 7 DO - 10.7763/IPCSIT UR - https://m2.mtmt.hu/api/publication/23534274 ID - 23534274 LA - English DB - MTMT ER - TY - JOUR AU - Adonyi, R AU - Heckl, István AU - Szalamin, A AU - Olti, F TI - Routing of railway systems with the S-graph framework for effective scheduling JF - CHEMICAL ENGINEERING TRANSACTIONS J2 - CHEM ENG TR VL - 21 PY - 2010 SP - 913 EP - 918 PG - 6 SN - 9788895608051 SN - 1974-9791 DO - 10.3303/CET1021153 UR - https://m2.mtmt.hu/api/publication/2175015 ID - 2175015 LA - English DB - MTMT ER - TY - JOUR AU - Adonyi, R AU - Shopova, E AU - Vaklieva-Bancheva, N TI - Optimal Schedule of a Dairy Manufactory JF - CHEMICAL AND BIOCHEMICAL ENGINEERING QUARTERLY J2 - CHEM BIOCHEM ENG Q VL - 23 PY - 2009 IS - 2 SP - 231 EP - 237 PG - 7 SN - 0352-9568 UR - https://m2.mtmt.hu/api/publication/20792257 ID - 20792257 N1 - Department of Computer Science, University of Pannonia, Veszprem, Egyetem u. 10, H-8200, Hungary, Hungary Bulgarian Academy of Sciences, Institute of Chemical Engineering, Acad. G. Bonchev Str., Bl.103, Sofia, 1113, Bulgaria Cited By :4 Export Date: 16 October 2023 CODEN: CBEQE Correspondence Address: Shopova, E.; Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl.103, Sofia, 1113, Bulgaria; email: eshopova@mail.bg LA - English DB - MTMT ER - TY - JOUR AU - Hegyháti, Máté AU - Majozi, T AU - Holczinger, Tibor AU - Friedler, Ferenc TI - Practical infeasibility of cross-transfer in batch plants with complex recipes: S-graph vs MILP methods JF - CHEMICAL ENGINEERING SCIENCE J2 - CHEM ENG SCI VL - 64 PY - 2009 IS - 3 SP - 605 EP - 610 PG - 6 SN - 0009-2509 DO - 10.1016/j.ces.2008.10.018 UR - https://m2.mtmt.hu/api/publication/1230388 ID - 1230388 N1 - Department of Computer Science, University of Pannonia, Egyetem u. 10, Veszprém, H-8200, Hungary Department of Chemical Engineering, University of Pretoria, Lynnwood Road, Pretoria, 0002, South Africa Cited By :14 Export Date: 16 October 2023 CODEN: CESCA Correspondence Address: Friedler, F.; Department of Computer Science, Egyetem u. 10, Veszprém, H-8200, Hungary; email: friedler@dcs.uni-pannon.hu LA - English DB - MTMT ER - TY - JOUR AU - Adonyi, Róbert AU - Biros, G AU - Holczinger, Tibor AU - Friedler, Ferenc TI - Effective scheduling of a large-scale paint production system JF - JOURNAL OF CLEANER PRODUCTION J2 - J CLEAN PROD VL - 16 PY - 2008 IS - 2 SP - 225 EP - 232 PG - 8 SN - 0959-6526 DO - 10.1016/j.jclepro.2006.08.021 UR - https://m2.mtmt.hu/api/publication/1060645 ID - 1060645 N1 - Cited By :23 Export Date: 16 October 2023 CODEN: JCROE Correspondence Address: Friedler, F.; Department of Computer Science, Egyetem u. 10, Veszprem, H-8200, Hungary; email: friedler@dcs.vein.hu LA - English DB - MTMT ER - TY - THES AU - Kulcsár, Gyula TI - Ütemezési model és heurisztikus módszerek az igény szerinti tömeggyártás finomprogramozásának támogatására PY - 2007 SP - 146 UR - https://m2.mtmt.hu/api/publication/21585596 ID - 21585596 N1 - Miskolci Egyetem, Miskolc LA - Hungarian DB - MTMT ER - TY - CHAP AU - Ferrer-Nadal, S. AU - Holczinger, T. AU - Méndez, C.A. AU - Friedler, F. AU - Puigjaner, L. TI - Rigorous scheduling resolution of complex multipurpose batch plants: S-Graph vs. MILP T2 - Computer Aided Chemical Engineering VL - 21 T3 - Computer-Aided Chemical Engineering, ISSN 1570-7946 ; 21. PY - 2006 IS - C SP - 2033 EP - 2038 PG - 6 DO - 10.1016/S1570-7946(06)80347-0 UR - https://m2.mtmt.hu/api/publication/34201941 ID - 34201941 N1 - Chemical Engineering Department-CEPIMA, Universitat Politècnica de Catalunya ETSEIB, Av. Diagonal 647, E-08028 Barcelona, Spain Department of Computer Science, University of Veszprém, Egyetem u. 10, H-8200 Veszprém, Hungary Cited By :2 Export Date: 17 October 2023 Correspondence Address: Ferrer-Nadal, S.; Chemical Engineering Department-CEPIMA, Av. Diagonal 647, E-08028 Barcelona, Spain Funding details: Generalitat de Catalunya Funding details: European Social Fund, ESF Funding text 1: Financial support received from the European Community projects (MRTN-CT-2004-512233; RFC-CR-04006; INCO-CT-2005-013359) and the Generalitat de Catalunya with the European Social Fund (FI grant) is fully appreciated. AB - Highly efficient optimization methods are needed to deal rigorously with complex short-term production scheduling problems. This work presents a comparative study of two alternative solution strategies based on a mathematical programming approach and a graph-oriented method. Different scenarios of increasing complexity are addressed in order to evaluate the current capabilities and limitations of each solution method. © 2006 Elsevier B.V. All rights reserved. LA - English DB - MTMT ER - TY - JOUR AU - Majozi, T AU - Friedler, Ferenc TI - Maximization of Throughput in a Multipurpose Batch Plant Under Fixed Time Horizon: S-Graph Approach JF - INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH J2 - IND ENG CHEM RES VL - 45 PY - 2006 IS - 20 SP - 6713 EP - 6720 PG - 8 SN - 0888-5885 DO - 10.1021/ie0604472 UR - https://m2.mtmt.hu/api/publication/1049293 ID - 1049293 N1 - Cited By :19 Export Date: 16 October 2023 CODEN: IECRE Correspondence Address: Friedler, F.; Department of Computer Science, Egyetem u. 10, Veszprém, H-8200, Hungary; email: friedler@dcs.vein.hu LA - English DB - MTMT ER - TY - JOUR AU - Romero, J AU - Puigjaner, L AU - Holczinger, Tibor AU - Friedler, Ferenc TI - Scheduling intermediate storage multipurpose batch plants using the S-graph JF - AICHE JOURNAL J2 - AICHE J VL - 50 PY - 2004 IS - 2 SP - 403 EP - 417 PG - 15 SN - 0001-1541 DO - 10.1002/aic.10036 UR - https://m2.mtmt.hu/api/publication/1044820 ID - 1044820 N1 - Chemical Engineering Dept., Universidad Politecnica de Catalunya, E-08028 Barcelona, Spain Dept. of Computer Science, University of Veszprém, Egyetem u. 10, H-8200, Veszprém, Hungary Cited By :26 Export Date: 16 October 2023 CODEN: AICEA Correspondence Address: Puigjaner, L.; Chemical Engineering Dept., , E-08028 Barcelona, Spain; email: Luis.Puigjaner@upc.es LA - English DB - MTMT ER -