@article{MTMT:31396097,
	title = {Addressing storage time restrictions in the S-graph scheduling framework},
	url = {https://m2.mtmt.hu/api/publication/31396097},
	author = {Hegyháti, Máté and Holczinger, Tibor and Ősz, Olivér},
	doi = {10.1007/s11081-020-09548-1},
	journal-iso = {OPTIM ENG},
	journal = {OPTIMIZATION AND ENGINEERING},
	volume = {22},
	unique-id = {31396097},
	issn = {1389-4420},
	year = {2021},
	eissn = {1573-2924},
	pages = {2679-2706},
	orcid-numbers = {Hegyháti, Máté/0000-0003-3689-9866; Holczinger, Tibor/0000-0003-4427-9253; Ősz, Olivér/0000-0001-5306-0451}
}

@article{MTMT:30686995,
	title = {Scheduling approach for on-site jobs of service providers},
	url = {https://m2.mtmt.hu/api/publication/30686995},
	author = {Holczinger, Tibor and Ősz, Olivér and Hegyháti, Máté},
	doi = {10.1007/s10696-019-09359-2},
	journal-iso = {FLEX SERV MANUFACT J},
	journal = {FLEXIBLE SERVICES AND MANUFACTURING JOURNAL},
	volume = {32},
	unique-id = {30686995},
	issn = {1936-6582},
	abstract = {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.},
	year = {2020},
	eissn = {1936-6590},
	pages = {913-948},
	orcid-numbers = {Holczinger, Tibor/0000-0003-4427-9253; Ősz, Olivér/0000-0001-5306-0451; Hegyháti, Máté/0000-0003-3689-9866}
}

@article{MTMT:25379681,
	title = {Systematic approach for designing and activities' scheduling of supply chain network},
	url = {https://m2.mtmt.hu/api/publication/25379681},
	author = {Adonyi, R and Kirilova, EG and Vaklieva-Bancheva, NG},
	journal-iso = {BULG CHEM COMMUN},
	journal = {BULGARIAN CHEMICAL COMMUNICATIONS},
	volume = {45},
	unique-id = {25379681},
	issn = {0324-1130},
	year = {2013},
	eissn = {0861-9808},
	pages = {288-295}
}

@CONFERENCE{MTMT:23534274,
	title = {Analysis on Production Processe Optimization of Small-Mddle Float Glass Manufacturer. Shenmu Float Glass Manufacturer in Shaanxi Province as an Example},
	url = {https://m2.mtmt.hu/api/publication/23534274},
	author = {Jing, Yang and Yingwen, Pan},
	booktitle = {2nd International Conference on Information and Multimedia Technology (ICIMT 2010)},
	doi = {10.7763/IPCSIT},
	publisher = {IACSIT Press},
	unique-id = {23534274},
	year = {2012},
	pages = {102-108}
}

@article{MTMT:2175015,
	title = {Routing of railway systems with the S-graph framework for effective scheduling},
	url = {https://m2.mtmt.hu/api/publication/2175015},
	isbn = {9788895608051},
	author = {Adonyi, R and Heckl, István and Szalamin, A and Olti, F},
	doi = {10.3303/CET1021153},
	journal-iso = {CHEM ENG TR},
	journal = {CHEMICAL ENGINEERING TRANSACTIONS},
	volume = {21},
	unique-id = {2175015},
	issn = {1974-9791},
	year = {2010},
	eissn = {2283-9216},
	pages = {913-918}
}

@article{MTMT:20792257,
	title = {Optimal Schedule of a Dairy Manufactory},
	url = {https://m2.mtmt.hu/api/publication/20792257},
	author = {Adonyi, R and Shopova, E and Vaklieva-Bancheva, N},
	journal-iso = {CHEM BIOCHEM ENG Q},
	journal = {CHEMICAL AND BIOCHEMICAL ENGINEERING QUARTERLY},
	volume = {23},
	unique-id = {20792257},
	issn = {0352-9568},
	year = {2009},
	eissn = {1846-5153},
	pages = {231-237}
}

@article{MTMT:1230388,
	title = {Practical infeasibility of cross-transfer in batch plants with complex recipes: S-graph vs MILP methods},
	url = {https://m2.mtmt.hu/api/publication/1230388},
	author = {Hegyháti, Máté and Majozi, T and Holczinger, Tibor and Friedler, Ferenc},
	doi = {10.1016/j.ces.2008.10.018},
	journal-iso = {CHEM ENG SCI},
	journal = {CHEMICAL ENGINEERING SCIENCE},
	volume = {64},
	unique-id = {1230388},
	issn = {0009-2509},
	year = {2009},
	eissn = {1873-4405},
	pages = {605-610},
	orcid-numbers = {Hegyháti, Máté/0000-0003-3689-9866; Holczinger, Tibor/0000-0003-4427-9253}
}

@article{MTMT:1060645,
	title = {Effective scheduling of a large-scale paint production system},
	url = {https://m2.mtmt.hu/api/publication/1060645},
	author = {Adonyi, Róbert and Biros, G and Holczinger, Tibor and Friedler, Ferenc},
	doi = {10.1016/j.jclepro.2006.08.021},
	journal-iso = {J CLEAN PROD},
	journal = {JOURNAL OF CLEANER PRODUCTION},
	volume = {16},
	unique-id = {1060645},
	issn = {0959-6526},
	year = {2008},
	eissn = {1879-1786},
	pages = {225-232},
	orcid-numbers = {Holczinger, Tibor/0000-0003-4427-9253}
}

@mastersthesis{MTMT:21585596,
	title = {Ütemezési model és heurisztikus módszerek az igény szerinti tömeggyártás finomprogramozásának támogatására},
	url = {https://m2.mtmt.hu/api/publication/21585596},
	author = {Kulcsár, Gyula},
	unique-id = {21585596},
	year = {2007}
}

@{MTMT:34201941,
	title = {Rigorous scheduling resolution of complex multipurpose batch plants: S-Graph vs. MILP},
	url = {https://m2.mtmt.hu/api/publication/34201941},
	author = {Ferrer-Nadal, S. and Holczinger, T. and Méndez, C.A. and Friedler, F. and Puigjaner, L.},
	booktitle = {Computer Aided Chemical Engineering},
	doi = {10.1016/S1570-7946(06)80347-0},
	volume = {21},
	unique-id = {34201941},
	abstract = {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.},
	keywords = {S-graph; MILP model; Batch operations},
	year = {2006},
	pages = {2033-2038}
}

@article{MTMT:1049293,
	title = {Maximization of Throughput in a Multipurpose Batch Plant Under Fixed Time Horizon: S-Graph Approach},
	url = {https://m2.mtmt.hu/api/publication/1049293},
	author = {Majozi, T and Friedler, Ferenc},
	doi = {10.1021/ie0604472},
	journal-iso = {IND ENG CHEM RES},
	journal = {INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH},
	volume = {45},
	unique-id = {1049293},
	issn = {0888-5885},
	year = {2006},
	eissn = {1520-5045},
	pages = {6713-6720}
}

@article{MTMT:1044820,
	title = {Scheduling intermediate storage multipurpose batch plants using the S-graph},
	url = {https://m2.mtmt.hu/api/publication/1044820},
	author = {Romero, J and Puigjaner, L and Holczinger, Tibor and Friedler, Ferenc},
	doi = {10.1002/aic.10036},
	journal-iso = {AICHE J},
	journal = {AICHE JOURNAL},
	volume = {50},
	unique-id = {1044820},
	issn = {0001-1541},
	year = {2004},
	eissn = {1547-5905},
	pages = {403-417},
	orcid-numbers = {Holczinger, Tibor/0000-0003-4427-9253}
}