Access the full text.
Sign up today, get DeepDyve free for 14 days.
Most conventional discrete-event simulation software assumes a simple progression of entities through queues and activities. Such software cannot cope easily with modeling systems where entities can be present in more than one queue, can be involved in more than one activity (i.e., scheduled for more than one event), or can be interrupted while queuing or taking part in an activity in order to join another queue or take part in a different activity. Low-level data structures to address these problems have been implemented in Pascal by extending an existing suite of Pascal procedures, call Pascal_SIM. The problems and their solutions are discussed in the context of machine breakdown in a production system. Comparisons between the use of the new structures and the existing ones showed some gain in computational efficiency and considerable improvement in ease of modeling. The generality of the data structure is considered.
ACM Transactions on Modeling and Computer Simulation (TOMACS) – Association for Computing Machinery
Published: Oct 1, 1993
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.