109. Process Network Solution of a Sport Shooting Event Scheduling Problem
Invited abstract in session TC-4: P-graph Applications II., stream P-graph algorithms and applications.
Thursday, 12:00 - 13:30Room: C105
Authors (first author is the speaker)
| 1. | Zsolt Ercsey
|
| Department of Systems and Software Technologies, University of Pécs | |
| 2. | Zoltán Kovács
|
| Optin Ltd. | |
| 3. | Tamás Storcz
|
| Department of Systems and Software Technologies, University of Pécs |
Abstract
The paper explains the process network solution of amateur sport shooting competition scheduling problems. There is a limited number of firing points where the optimal schedule of the registered competitors should be determined. The competitors are part of teams or sport clubs, where each competitor can be a member of exactly one of the teams. During the competition there are various disciplines with various time limits; where on one hand one competitor may complete one or more disciplines, and on the other hand any discipline can only be completed once by the competitors. Any discipline may be performed by any competitor at any firing point parallelly; moreover, synchronously started and parallelly executed disciplines are grouped into series. This problem is presented as an application of the p-graph methodology. The focus is on the synthesis step, where the corresponding process network is explained and detailed. Based on the maximal structure of the problem a mathematical programming model is generated and solved. Example of a national competition is presented as illustration.
Keywords
- Mixed integer nonlinear optimization
Status: accepted
Back to the list of papers