. . . . . "Modelling Alternatives in Temporal Networks"@en . . . . "121;128" . "\u010Cl\u00E1nek navrhuje roz\u0161\u00ED\u0159en\u00ED tempor\u00E1ln\u00EDch s\u00EDt\u00ED o paraleln\u00ED a alternativn\u00ED v\u011Btven\u00ED, kter\u00E9 umo\u017E\u0148uje modelovat alternativn\u00ED cesty v s\u00EDti."@cs . "3"^^ . "486196" . . "Nottingham" . "Nottingham" . "3"^^ . . "RIV/00216208:11320/06:00002925" . . "RIV/00216208:11320/06:00002925!RIV07-MSM-11320___" . "Proceedings of the 25th Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG)" . "11320" . . "Modelov\u00E1n\u00ED alternativ v tempor\u00E1ln\u00EDch s\u00EDt\u00EDch"@cs . . . "\u010Cepek, Ond\u0159ej" . . "1368-5708" . "Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NP-complete problem. To simplify solving this problem, we propose a pre-processing step whose goal is to identify classes of equivalent nodes. The ideas are presented using precedence networks, but we also show how they can be extended to simple temporal networks."@en . "Modelling Alternatives in Temporal Networks" . . . "Bart\u00E1k, Roman" . "The University of Nottingham" . "Surynek, Pavel" . "Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NP-complete problem. To simplify solving this problem, we propose a pre-processing step whose goal is to identify classes of equivalent nodes. The ideas are presented using precedence networks, but we also show how they can be extended to simple temporal networks." . "2006-01-01+01:00"^^ . "Modelling Alternatives in Temporal Networks"@en . . "Modelling Alternatives in Temporal Networks" . . . "Modelov\u00E1n\u00ED alternativ v tempor\u00E1ln\u00EDch s\u00EDt\u00EDch"@cs . "Modelling; Alternatives; Temporal; Networks"@en . "8"^^ . . . . "[CFF55276C2EC]" . "P(1M0545), P(GA201/04/1102), P(GD201/05/H014), Z(MSM0021620838)" .