Service fairness and value of customer information for the stochastic container relocation problem under flexible service policy

•Address service fairness in Stochastic Container Relocation Problem under flexible service policy.•Propose a multiple sub-time windows-based flexible service policy to balance service efficiency and service fairness.•Formulate a stochastic dynamic programming model with two lexicographically ordered objectives.•Present efficient heuristic algorithms to solve the optimisation problem.•Conduct extensive computational experiments to generate managerial insights regarding the trade-offs between efficiency and fairness and the value of the information of trucks’ arrival probability over the time window.