@misc{MTMT:30729723,
	title = {Scheduling of the transport of renewables for a power plant},
	url = {https://m2.mtmt.hu/api/publication/30729723},
	author = {Heckl, István and Adonyi, Róbert and Bertók, Botond and Szlama, Adrián György},
	unique-id = {30729723},
	year = {2012}
}

@misc{MTMT:30729704,
	title = {Construction project scheduling by P­graphs},
	url = {https://m2.mtmt.hu/api/publication/30729704},
	author = {Adonyi, Róbert and Heckl, István and F., Olti},
	unique-id = {30729704},
	year = {2012}
}

@inproceedings{MTMT:1976935,
	title = {Superstructure Approach to Batch Process Scheduling by S-graph Representation},
	url = {https://m2.mtmt.hu/api/publication/1976935},
	author = {Bertók, Botond and Adonyi, Róbert and Friedler, Ferenc and Fan, L T},
	booktitle = {ESCAPE 21. 21st European symposium on computer-aided process engineering. Chalkidiki, 2011},
	doi = {10.1016/B978-0-444-53711-9.50221-2},
	unique-id = {1976935},
	abstract = {Scheduling plays a key role in batch process operation; it has a 
		major effect on the process' performance. Available methods for 
		determining the optimal schedule are primarily based on either 
		MILP/MINLP formulation in conjunction with mathematical 
		programming (Floudas and Lin, 2004; Vaklieva-Bancheva and 
		Kirilova, 2010) or graph representation in conjunction with 
		combinatorial algorithms (Sanmarti et al., 2002).The current 
		work comprises three major contributions. First, an algorithm 
		has been crafted to generate a superstructure for a scheduling 
		problem. The problem is defined in the form of an S-graph 
		representing the recipe. The superstructure contains exclusively 
		every step potentially performed by any of the functional or 
		operating facilities or equipment units capable of completing at 
		least one task to be scheduled. These steps involve executions 
		of tasks and changeovers from one task to another. Second, an 
		MILP formulation is elaborated on the basis of the 
		superstructure, which guarantees the optimal solution of the 
		scheduling problem. Third, a relaxation of the MILP model is 
		incorporated into the S-graph algorithms to support the 
		selection of subproblems and decision variables in the branch-
		and-bound procedure. © 2011 Elsevier B.V.},
	keywords = {Scheduling; MILP; Superstructure; S-graph},
	year = {2011},
	pages = {1105-1109},
	orcid-numbers = {Bertók, Botond/0000-0002-1297-9792}
}

@misc{MTMT:30730141,
	title = {Routing of railway systems with the S­graph framework},
	url = {https://m2.mtmt.hu/api/publication/30730141},
	author = {Adonyi, Róbert and Heckl, István and A., Szalamin and F., Olti},
	unique-id = {30730141},
	year = {2010}
}

@misc{MTMT:30730135,
	title = {Scheduling of Bus Maintenance by the P­ graph Methodology},
	url = {https://m2.mtmt.hu/api/publication/30730135},
	author = {Adonyi, Róbert and Heckl, István and F., Olti},
	unique-id = {30730135},
	year = {2010}
}

@article{MTMT:1697061,
	title = {Optimal Design of Supply Chains by the P-Graph Framework},
	url = {https://m2.mtmt.hu/api/publication/1697061},
	author = {Bertók, Botond and Adonyi, Róbert and Friedler, Ferenc},
	journal-iso = {COMPAIDED CHEMI ENG},
	journal = {COMPUTER-AIDED CHEMICAL ENGINEERING},
	volume = {25},
	unique-id = {1697061},
	issn = {1570-7946},
	year = {2009},
	pages = {1445-1450},
	orcid-numbers = {Bertók, Botond/0000-0002-1297-9792}
}

@CONFERENCE{MTMT:32559429,
	title = {Conceptual Design of Business Processes by Process-Network Synthesis},
	url = {https://m2.mtmt.hu/api/publication/32559429},
	author = {Adonyi, Róbert and Kalauz, Károly and Bertók, Botond and L. T., Fan and Friedler, Ferenc},
	booktitle = {Vocal 2008 : program and abstracts},
	unique-id = {32559429},
	year = {2008},
	pages = {34},
	orcid-numbers = {Bertók, Botond/0000-0002-1297-9792}
}

@misc{MTMT:30730149,
	title = {Formulating and Solving Vehicle Routing Problems by the P­graph Framework},
	url = {https://m2.mtmt.hu/api/publication/30730149},
	author = {Heckl, István and Adonyi, Róbert and Bertók, Botond and Friedler, Ferenc and L.T., Fan and Kovács, Zoltán},
	unique-id = {30730149},
	year = {2008},
	orcid-numbers = {Bertók, Botond/0000-0002-1297-9792}
}

@{MTMT:1230470,
	title = {Demonstration program for S-graph based batch-process scheduling},
	url = {https://m2.mtmt.hu/api/publication/1230470},
	author = {Hegyháti, Máté and Adonyi, Róbert and Holczinger, Tibor and Friedler, Ferenc},
	booktitle = {9th Conference of Process Integration, Modelling and Optimisation for Energy Saving and Pollution Reduction: PRES 06},
	unique-id = {1230470},
	year = {2008},
	pages = {1378},
	orcid-numbers = {Hegyháti, Máté/0000-0003-3689-9866; Holczinger, Tibor/0000-0003-4427-9253}
}

@{MTMT:1230468,
	title = {Optimal schedule of a dairy manufactory},
	url = {https://m2.mtmt.hu/api/publication/1230468},
	author = {Adonyi, Róbert and Shopova, E and Friedler, Ferenc and Vaklieva-Bancheva, N},
	booktitle = {9th Conference of Process Integration, Modelling and Optimisation for Energy Saving and Pollution Reduction: PRES 06},
	unique-id = {1230468},
	year = {2008},
	pages = {1375}
}