Optimization Online


Branch and Bound Algorithms for Minimizing Maximum Lateness of Trucks at a Transshipment Terminal

Dirk Briskorn (briskorn***at***wiso.uni-koeln.de)
Joseph Leung (leung***at***cis.njit.edu)

Abstract: This paper focuses on the scheduling of trucks at a transshipment terminal with a single gate. Trucks deliver or pick up a single type of items at the gate and, therefore, increase or decrease, respectively, the inventory level. Naturally, pick up trucks can be served only if the required amount of items is available in the inventory. We consider the problem to find a schedule for trucks such that the maximum lateness among all trucks is minimized. We develop properties of optimal solutions, lower bounds, and heuristic methods in order to find upper bounds. These are incorporated in four branch and bound algorithms which are based on fixing sequences of trucks in forward or backward direction in two different types of representations. By means of a computational study we compare these approaches to each other in order to show their efficiency.

Keywords: Transshipment terminals, trucks, scheduling, maximum lateness, inventory constraints.

Category 1: Applications -- OR and Management Sciences

Category 2: Applications -- OR and Management Sciences (Transportation )

Category 3: Combinatorial Optimization



Entry Submitted: 07/16/2010
Entry Accepted: 07/16/2010
Entry Last Modified: 10/26/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society