University of Groningen
Discrete-Event Control and Optimization of Container Terminal Operations Tri Cahyono, Rully
DOI:
10.33612/diss.156020098
IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document version below.
Document Version
Publisher's PDF, also known as Version of record
Publication date: 2021
Link to publication in University of Groningen/UMCG research database
Citation for published version (APA):
Tri Cahyono, R. (2021). Discrete-Event Control and Optimization of Container Terminal Operations. University of Groningen. https://doi.org/10.33612/diss.156020098
Copyright
Other than for strictly personal use, it is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license (like Creative Commons).
Take-down policy
If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.
Downloaded from the University of Groningen/UMCG research database (Pure): http://www.rug.nl/research/portal. For technical reasons the number of authors shown on this cover page is limited to 10 maximum.
Propositions
Discrete-Event Control and Optimization of Container Terminal
Operations
1. To model a dynamical system with asynchronous multi-event transitions, such as the terminal operations, we can use events' end-time as state variables for triggering a new process while the rest of the events continue their on-going process uninterrupted. (Chapter 3)
2. In the model predictive allocation algorithm, we need the preconditioning steps which can be based on the ordering of arrival time, operations time, or distance. (Chapter 3 and 6)
3. The field experiment teaches scholars that the proposed method which has a better performance does not always satisfy the sailors in the vessels. They (the sailors) have a strong preference for the existing berth allocation policy. (Chapter 3)
4. For a linear DESDIS given by a Markov chain and for a particular cost function given by the sum of its state trajectories, the allocation problem is solved by re-ordering the input sequence at any given event time based on the potential contribution of the members in the current sequence to the present state of the system. (Chapter 4) 5. Applying the optimal policy only to important seaports in a network of container
terminals gives lower total network cost than arbitrary selection. But, in a non-economically balanced network like in Indonesia, this may not be the best policy, since this may result in more economic inequality among seaports. (Chapter 5) 6. Incorporating finite state machine in integrated container terminal operations does
not add to the problem’s complexity. It integrates well with the discrete-event systems framework. (Chapter 6).
7. If you endure one hundred kilometers riding a bicycle, you endure one week working on a paper.
8. At cloudy days in Bandung, I often wonder what the color of Groningen’s sky looks like. People care for what they love.
