Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/19788
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Roy, Debjit | |
dc.contributor.author | Saini, Suruchika | |
dc.contributor.author | Koster, Renéde | |
dc.date.accessioned | 2017-08-30T10:04:38Z | |
dc.date.available | 2017-08-30T10:04:38Z | |
dc.date.issued | 2017-11-14 | |
dc.identifier.citation | Computers and Operations Research, Vol.87, November 2017, Pp.40-51. | |
dc.identifier.uri | http://hdl.handle.net/11718/19788 | |
dc.description.abstract | New container terminal technologies such as passing dual yard cranes per stack promise increase in stacking throughput capacity. However, dual yard cranes can interfere, which reduces the cranes’ throughput capacity. Using crane operational protocols, we develop a stochastic model for two passing dual yard cranes and obtain closed-form expressions for the crane throughput capacity with interference delays. We then develop an approximate model to estimate the expected throughput times for both balanced and unbalanced stack configuration. A detailed discrete-event simulation is built to validate the analytical model. We show that interference effects between the cranes can reduce the crane throughput capacity by an average of 35% and interference delays increase with an increase in the number of bays in the stack. We use the model to develop operational insights | en_US |
dc.publisher | Elsevier | en_US |
dc.subject | Stochastic model | en_US |
dc.subject | Free and busy period analysis | en_US |
dc.subject | Interference delay | en_US |
dc.subject | Passing dual yard cranes | en_US |
dc.title | A stochastic model for the throughput analysis of passing dual yard cranes | en_US |
dc.type | Article | en_US |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Stochastic.pdf Restricted Access | 1.54 MB | Adobe PDF | View/Open Request a copy |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.