Pages that link to "Item:Q323023"
From MaRDI portal
The following pages link to Container relocation problem with time windows for container departure (Q323023):
Displaying 15 items.
- A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations (Q723924) (← links)
- The bounded beam search algorithm for the block relocation problem (Q1634080) (← links)
- An exact algorithm for the unrestricted block relocation problem (Q1652624) (← links)
- The block retrieval problem (Q1681149) (← links)
- An efficient ant colony optimization algorithm for the blocks relocation problem (Q1755234) (← links)
- A local-search based heuristic for the unrestricted block relocation problem (Q2003414) (← links)
- Smart stacking for import containers using customer information at automated container terminals (Q2140194) (← links)
- An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules (Q2171596) (← links)
- The block relocation problem with appointment scheduling (Q2242274) (← links)
- Optimizing pre-processing and relocation moves in the stochastic container relocation problem (Q2294635) (← links)
- A branch and bound approach for large pre-marshalling problems (Q2424778) (← links)
- Pre-processing a container yard under limited available time (Q2664376) (← links)
- Optimizing the number of deployed yard cranes in a container terminal (Q5883816) (← links)
- Approximate dynamic programming for container stacking (Q6113333) (← links)
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions (Q6113444) (← links)