Work planning optimisation in ports: a simplex application

Iñigo L. Ansorena

International Journal of Mathematics in Operational Research, 2019, vol. 14, issue 1, 146-155

Abstract: This paper presents an optimisation of the work plan at the gate of Barcelona container terminal (also known as TCB). The optimisation problem is formulated in accordance with the average traffic flow as a linear programming (LP) problem. Constraints of the LP problem are based on the data collected at the gate of TCB. The LP problem is solved by simplex algorithm and the solution includes: First, the value of the objective function (that is the feasible solution that minimises the number of clerks at the gate throughout a day); and second, the value, contribution to the objective, reduced cost, and range of optimality for each decision variable. Once the optimal solution has been achieved a sensitivity analysis is developed. The methodological procedure presented in this paper is general enough to be applied to any other container terminal.

Keywords: ports; queues; trucks; container terminal; gate; linear programming; simplex; scheduling; optimisation; clerks; productivity; work planning; application. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=96985 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:14:y:2019:i:1:p:146-155

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().