TY  - GEN
AU  - Heckl, István
AU  - Adonyi, Róbert
AU  - Bertók, Botond
AU  - Szlama, Adrián György
TI  - Scheduling of the transport of renewables for a power plant
PY  - 2012
UR  - https://m2.mtmt.hu/api/publication/30729723
ID  - 30729723
LA  - English
DB  - MTMT
ER  - 

TY  - GEN
AU  - Adonyi, Róbert
AU  - Heckl, István
AU  - F., Olti
TI  - Construction project scheduling by P­graphs
PY  - 2012
UR  - https://m2.mtmt.hu/api/publication/30729704
ID  - 30729704
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Bertók, Botond
AU  - Adonyi, Róbert
AU  - Friedler, Ferenc
AU  - Fan, L T
ED  - Pistikopoulos, E
ED  - Georgiadis, M
ED  - Kokossin, A
TI  - Superstructure Approach to Batch Process Scheduling by S-graph Representation
T2  - ESCAPE 21. 21st European symposium on computer-aided process engineering. Chalkidiki, 2011
PB  - Elsevier
CY  - Amsterdam
SN  - 9780444538956
T3  - Computer aided chemical engineering ; 29.
PY  - 2011
SP  - 1105
EP  - 1109
PG  - 5
DO  - 10.1016/B978-0-444-53711-9.50221-2
UR  - https://m2.mtmt.hu/api/publication/1976935
ID  - 1976935
N1  - Department of Computer Science and Systems Technology, University of Pannonia, Egyetem u. 10, H-8200 Veszprem, Hungary            
            Department of Chemical Engineering, Kansas State University, Manhattan, KS 66506, United States            
            Cited By :4            
            Export Date: 16 October 2023            
            Correspondence Address: Bertok, B.; Department of Computer Science and Systems Technology, Egyetem u. 10, H-8200 Veszprem, Hungary
AB  - 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.
LA  - English
DB  - MTMT
ER  - 

TY  - GEN
AU  - Adonyi, Róbert
AU  - Heckl, István
AU  - A., Szalamin
AU  - F., Olti
TI  - Routing of railway systems with the S­graph framework
PY  - 2010
UR  - https://m2.mtmt.hu/api/publication/30730141
ID  - 30730141
LA  - English
DB  - MTMT
ER  - 

TY  - GEN
AU  - Adonyi, Róbert
AU  - Heckl, István
AU  - F., Olti
TI  - Scheduling of Bus Maintenance by the P­ graph Methodology
PY  - 2010
UR  - https://m2.mtmt.hu/api/publication/30730135
ID  - 30730135
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Bertók, Botond
AU  - Adonyi, Róbert
AU  - Friedler, Ferenc
TI  - Optimal Design of Supply Chains by the P-Graph Framework
JF  - COMPUTER-AIDED CHEMICAL ENGINEERING
J2  - COMPAIDED CHEMI ENG
VL  - 25
PY  - 2009
SP  - 1445
EP  - 1450
PG  - 6
SN  - 1570-7946
UR  - https://m2.mtmt.hu/api/publication/1697061
ID  - 1697061
LA  - English
DB  - MTMT
ER  - 

TY  - CONF
AU  - Adonyi, Róbert
AU  - Kalauz, Károly
AU  - Bertók, Botond
AU  - L. T., Fan
AU  - Friedler, Ferenc
ED  - Bertók, Botond
TI  - Conceptual Design of Business Processes by Process-Network Synthesis
T2  - Vocal 2008 : program and abstracts
PB  - Pannon Egyetem Műszaki Informatikai Kar
C1  - Veszprém
PY  - 2008
SP  - 34
UR  - https://m2.mtmt.hu/api/publication/32559429
ID  - 32559429
LA  - English
DB  - MTMT
ER  - 

TY  - GEN
AU  - Heckl, István
AU  - Adonyi, Róbert
AU  - Bertók, Botond
AU  - Friedler, Ferenc
AU  - L.T., Fan
AU  - Kovács, Zoltán
TI  - Formulating and Solving Vehicle Routing Problems by the P­graph Framework
PY  - 2008
UR  - https://m2.mtmt.hu/api/publication/30730149
ID  - 30730149
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Hegyháti, Máté
AU  - Adonyi, Róbert
AU  - Holczinger, Tibor
AU  - Friedler, Ferenc
ED  - Klemeš, Jiri Jaromir
ED  - Friedler, Ferenc
TI  - Demonstration program for S-graph based batch-process scheduling
T2  - 9th Conference of Process Integration, Modelling and Optimisation for Energy Saving and Pollution Reduction: PRES 06
PB  - Elsevier
CY  - Oxford
SN  - 9788086059457
PY  - 2008
SP  - 1378
UR  - https://m2.mtmt.hu/api/publication/1230470
ID  - 1230470
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Adonyi, Róbert
AU  - Shopova, E
AU  - Friedler, Ferenc
AU  - Vaklieva-Bancheva, N
ED  - Klemeš, Jiri Jaromir
ED  - Friedler, Ferenc
TI  - Optimal schedule of a dairy manufactory
T2  - 9th Conference of Process Integration, Modelling and Optimisation for Energy Saving and Pollution Reduction: PRES 06
PB  - Elsevier
CY  - Oxford
SN  - 9788086059457
PY  - 2008
SP  - 1375
UR  - https://m2.mtmt.hu/api/publication/1230468
ID  - 1230468
LA  - English
DB  - MTMT
ER  -