A crane scheduling method for port container terminals

Article Abstract:

A mathematical formulation for the Quay crane (QC) scheduling problem, which is an important problem in the operation of port container terminals is described. To solve the problem, a branch and bound (B & B) method and a lower bound of the optimal objective value is proposed.

Scheduling (Management), Branch and bound algorithms

---

A note on dynamic space-allocation method for outbound containers

Article Abstract:

Usage of sub-gradient optimization to devise methods, for space allocation to outbound containers before transportation from container terminals, is described.

South Korea, Mathematical optimization, Optimization theory

---

Three-dimensional packing of items with limited load bearing strength

Article Abstract:

A new heuristic approach for tackling container loading problems where the cargo involved has varying degrees of load bearing strength, is discussed.

Europe, Heuristic, Packing for shipment, Packing (Shipments), Heuristics (Psychology)

Similar abstracts:

• Abstracts: Scheduling multiprocessor tasks on parallel processors with limited availability. An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Abstracts: Can-order policies for coordinated inventory replenishment with Erlang distributed times between ordering. Flow distance reduction for a multi-product flowline with sets of identical machines
• Abstracts: Pattern languages: a framework for learning. Minimally biased weight determination in personnel selection. Blockmodels with maximum concentration

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.