An algorithm, based on finding a shortest route in a finite directed network, is given for the assembly line balancing problem. Arc lengths are such that it is sufficient to find any path from the origin to destination node containing a minimal number of arcs. Computational results are presented...

This paper presents a detailed description of a particular class of deterministic single product Maritime Inventory Routing Problems (MIRPs), which we call deep-sea MIRPs with inventory tracking at every port. This class involves vessel travel times between ports that are significantly longer...