An exact method for scheduling a yard crane

Gharehgozli, Amir; Yu, Yugang; Koster, René de; Udding, Jan Tijmen

doi:10.1016/j.ejor.2013.09.038

Cited by 75 publications

(38 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As it will be explained in §4, this can be realized in polynomial time by solving several APs. For the case of more than two depots, Gharehgozli et al (2014b) develop a nonpolynomial algorithm using the same idea.…”

Section: Literature Reviewmentioning

confidence: 99%

“…These move containers to one of the two depots at the seaside or landside of the container rack where the S/R machine takes them to a slot in the rack. A more traditional container AS/RS consists of a container block stack and a stacker crane (Gharehgozli et al 2014b). Figure 2(b) shows a block of containers stacked in multiple rows, bays, and tiers.…”

Section: Introductionmentioning

confidence: 99%

“…We explain this schematically. For a complete explanation and a proof, the interested reader is referred toGharehgozli et al (2014b). The Downloaded from informs.org by[128.248.155.225] on 09 February 2015, at 01:05 .…”

mentioning

confidence: 99%

See 2 more Smart Citations

Polynomial Time Algorithms to Minimize Total Travel Time in a Two-Depot Automated Storage/Retrieval System

Gharehgozli¹,

Yu²,

Zhang³

et al. 2017

Transportation Science

Self Cite

View full text Add to dashboard Cite

W e sequence storage and retrieval jobs to minimize total travel time of a storage/retrieval S/R machine in a two-depot automated storage/retrieval system. These systems include storage systems with aislecaptive S/R machines and storage blocks with bridge cranes. The S/R machine must move retrieval unit loads from their current locations in the system to one of the two depots. In addition, it must move storage unit loads from given depots to given locations in the system. We model the problem as an asymmetric traveling salesman problem, which is in general -hard. We develop an algorithm to solve the problem in polynomial time, using the property that the system has two depots and the S/R machine always returns to one of the depots to pick up or deliver a load. Furthermore, we develop additional polynomial time algorithms for the following four special cases: (1) retrieval loads have to be delivered to given depots; (2) the system has one input depot and one output depot; (3) the system has a single depot; and (4) there are arbitrary S/R machine starting and ending locations. The computational results show the effectiveness of the proposed algorithms. Compared to first-come-first-served and nearest neighbor algorithms, commonly used in practice, the total travel time reduces on average by more than 30% and 15%, respectively.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Polynomial Time Algorithms to Minimize Total Travel Time in a Two-Depot Automated Storage/Retrieval System

Gharehgozli¹,

Yu²,

Zhang³

et al. 2017

Transportation Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…They treated the problem as an online optimization problem and constructed a new crane schedule for a certain planning horizon whenever a new job arrives or a job is completed. Gharehgozli et al (2014b) modeled the one-YC scheduling problem with both the storage and retrieval jobs in a single container block into a continuous time integer programming problem. A two-phase solution method, which utilized the intrinsic properties of the model, was adopted to optimally solve the problem.…”

Section: Yard Areamentioning

confidence: 99%

Planning and Scheduling for Maritime Container Yards

Li¹,

Wu²,

Goh³

2015

View full text Add to dashboard Cite

“…Stacking crane scheduling is one of the main parts of planning container terminal activities, and there has been a rapid growth of research in this area over the last decade. Comprehensive literature reviews of problems, models and solution methods in storage yard operations of a container terminal are provided by Stahlbock and Voß , Kemme , Carlo, Vis, and Roodbergen , Gharehgozli et al , He et al , Li et al , Wu et al , van Dijk , Kaveshgar and Huynh , Shu et al and Boysen et al .…”

Section: Introductionmentioning

confidence: 99%

A note on scheduling container storage operations of two non‐passing stacking cranes

2017

View full text Add to dashboard Cite

We study a scheduling problem for a container block, in which there are incoming containers only. Container placement is served by two non‐passing stacking cranes based at the opposite sides of the container block. The same time is required for any crane to move between two adjacent bays of the container block and the same different time is required for any crane to perform any down‐and‐up operation related to container lifting at the pick‐up point or container lowering at the storage point. Containers are assigned to the cranes according to one of the following policies: (1) two fixed sequences policy where a container processing sequence is given for each crane, (2) dedicated crane policy where containers are preassigned to the cranes, (3) one fixed, one arbitrary sequence policy where a container processing sequence is given for one crane and it can be arbitrary for the other crane, (4) flexible policy where any container can be assigned to any crane at any time, and (5) global fixed sequence policy where the container sequence is given and the relative processing order of containers in this sequence must be preserved by any crane. The objective is to minimize the completion time of the latest operation. We show that the problem is polynomially solvable for policy 1 and, if the number of containers to be placed in the same bay is no more than a half of all containers, for policy 4. It is NP‐hard in the strong sense for policies 2 and 3. Approximation algorithms with guaranteed absolute and relative deviations from the optimum are devised for policies 4 and 5. The results translate for the case of outgoing containers only.

show abstract

An exact method for scheduling a yard crane

Cited by 75 publications

References 30 publications

Polynomial Time Algorithms to Minimize Total Travel Time in a Two-Depot Automated Storage/Retrieval System

Polynomial Time Algorithms to Minimize Total Travel Time in a Two-Depot Automated Storage/Retrieval System

Planning and Scheduling for Maritime Container Yards

A note on scheduling container storage operations of two non‐passing stacking cranes

Contact Info

Product

Resources

About