In this paper, based on the Position Maintaining Strategy (PMS for short), on-line scheduling of k-truck problem, which is a generalization of the famous k-server problem, is originally presented by our team. We proposed several competitive algorithms applicable under different conditions for solving the on-line k-truck problem. First, a competitive algorithm with competitive ratio 2k + 1/θ is ...

Transportation businesses reduce costs by optimizing the routes of their trucks. However, determining optimal truck schedules is computationally intensive, running for hours on sequential computers. This article describes experience with parallelizing SAP’s Vehicle Scheduling and Routing Optimizer on shared-memory multicore computers. Re-engineering this complex application for a 24-core machin...

The problem of staff scheduling at a truck hub for loading and stripping of the trucks is an important and difficult problem to optimize the labor efficiency and cost. The trucks enter the hub at different hours a day, in different known time schedules and operating hours. In this paper, we propose a goal programming to maximize the labor efficiency via minimizing the allocation cost. The propo...

Full terms and conditions of use: http://pubsonline.informs.org/page/terms-and-conditions This article may be used only for the purposes of research, teaching, and/or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher approval, unless otherwise noted. For more information, contact [email protected]. The...

Oil terminals are widely used to store various liquids and gases. The refinery scheduling problem is one of the most challenging problems in operational research due to the complexity of the refinery scheduling operations and the corresponding process models. In this paper, we present a model by which a decision maker should be able to choose the optimal number of tanks, tank size and truck arr...

Cross-docking is a relatively new logistic strategy which seeks to make economies in transportation, decrease lead time and reduce inventory. The main principle is to unload, sort, consolidate and transfer delivered packages from inbound trucks to outbound trucks, with a minimum of storage or treatment in between. Two key issues associated to this field are the truck scheduling and the shop-flo...

The U.S. Truck Driver Scheduling Problem (US-TDSP) is the problem of visiting a sequence of λ locations within given time windows in such a way that driving and working activities of truck drivers comply with U.S. hours of service regulations. In the case of single time windows it is known that the US-TDSP can be solved in O(λ) time. In this paper we present a scheduling method for the US-TDSP ...

This paper considers a truck scheduling problem in the context of solid waste collection in Porto Alegre, Brazil. The problem consists of designing ``good" daily truck schedules over a set of previously defined collection trips, on which the trucks collect the solid waste in fixed routes and empty the loads in one of the several operational recycling facilities in the system. The main objective...