Recent developments in the shipping industry have opened some unprecedented trade opportunities on various levels. Be it individual consumption or business needs, the thought of receiving a package on the same day or within 4-hour from some other business or industry in the urban area is worth appreciating. The congestion on ground transportation modes is higher than ever. Since currently the same-day delivery in urban areas is carried mainly by ground modes, the catchment area of this delivery service is limited. The On-Demand Mobility for cargo can elevate the concept of express shipping in revolutionary ways. It will not only increase the catchment area thereby encompassing more business and consumers but will also expedite the delivery as these vehicles will fly over the ground traffic. The objective of this study was to estimate the total demand for ODM Cargo operations and study its effect on ODM passenger operations. The area of interest for this study was Northern California (17 counties). Annual cargo flows in the study area were rigorously analyzed through databases like Transearch, Freight Analysis Framework-4, and T-100 International for freight. The results of this study are presented through a parametric analysis of market share. The end product also includes the flight trajectories (with flight plan) of daily ODM cargo flights in the study region. The On-Demand Mobility cargo operations are expected to complement passenger On-Demand Mobility operations. Therefore, the effect of ODM cargo operations on the passenger ODM operations was also analyzed in this study. The major challenge faced in this study was the unavailability of datasets with the desired level of details and refinements. Since the movement of cargo is mostly done by private companies, the detailed records of shipments are often not public knowledge. / Master of Science / The recent advancements in shipping industry has made transfer of goods both domestic and international, swifter and more reliable. Nowadays, some business and consumers in urban areas have the options of few-hours or same day delivery. Currently the same-day delivery in urban areas is carried mainly by ground modes (trucks) and hence the catchment area of this delivery service is limited. Adding to it, the traffic congestion on the urban roads is a major hinderance in growth of such services. The On-Demand Mobility for cargo can reform express shipping in revolutionary ways. The concept vehicle can fly over the ground traffic. Therefore, it will increase the catchment area thereby encompassing more business and consumers, along with faster delivery options in currently serviced areas. For the study, we analyzed different databases for annual cargo flows in the region. Seventeen counties in the Northern California were chosen as the study area (or region). The study was focused on estimating the potential market (demand) for the On-Demand Mobility Cargo operations. Multiple set of results were calculated for different market shares that On-Demand Mobility can potentially capture in cargo operations. Flight trajectories (with flight plan) for daily ODM cargo flights were the final product. The On-Demand Mobility cargo operations are expected to complement passenger ODM operations. Therefore, the effect of ODM cargo operations on the passenger ODM operations was also analyzed in this study. The major challenge faced in this study was the unavailability of datasets with the desired level of details and refinements.

No description available.

Military Sealift Command (MSC) introduced its new Dry Cargo and Ammunition Ship (T-AKE) in June 2006, to replace its retiring ammunition and fast combat stores supply ships. MSC seeks new ways to use T-AKEs, fleet replenishment oilers, and fast combat support ships to better support the U.S. Navy. We evaluate two alternate ways to manage these ships, one where each ship operates under a particular "fleet ownership," and another where these ships are "globally allocated," serving any fleet customer as needed worldwide. We introduce an optimization-based scheduling tool, and use it to evaluate an expository 181-day peacetime scenario. We track daily inventories of 13 battle groups - carrier strike groups, expeditionary strike groups, surface strike groups, and a littoral combat ship squadron - to gain insight into how to best employ CLF ships. We determine that, in our scenario, global allocation provides significantly better service to fleet customers.

Presentación que corresponde a la unidad 3 del curso Recursos Humanos, titulada "Análisis de Puestos", del semestre 2007-2.

Presentación que corresponde a la unidad 5 del curso Recursos Humanos, titulada "Evaluación y Categorización de Puestos", del semestre 2007-2.

Thesis (M. Sc.)--University of Hong Kong, 2000. / Includes bibliographical references (leaves 143-148).

Thesis (M.Sc.)--University of Hong Kong, 2000. / Includes bibliographical references (leaves 143-148) Also available in print.

Thesis (Ph. D.)--University of Pittsburgh, 1956. / Photocopy. Ann Arbor, Mich. : University Microfilms International, 1981. -- 21 cm. Includes bibliographical references (leaves 131-137).

No description available.

This thesis examines exact and heuristic approaches to solve the Ship Routing and Scheduling Problem (SRSP). The method was developed to address the problem of loading cargos for many customers using heterogeneous vessels. Constraints relate to delivery time windows imposed by customers, the time horizon by which all deliveries must be made and vessel capacities. The objective is to minimise the overall operation cost, where all customers are satisfied. Two types of routing and scheduling are considered, one called single-cargo problem, where only one cargo can be loaded into a ship, and the second type called multi-cargo problem, where multiple products can be carried on a ship to be delivered to different customers. The exact approach comprises two stages. In the first stage, a number of candidate feasible schedules is generated for each ship in the fleet. The second stage is to model the problem as a set partitioning problem (SPP) where the columns are the candidate feasible schedules obtained in the first stage. The heuristic approach uses Tabu Search (TS). Most of the TS operations, such as insert and swap moves, tenure, tabu list, intensification, and diversification are used. The results of a computational investigation are presented. Solution quality and execution time are explored with respect to problem size and parameters controlling the tabu search such as tenure and neighbourhood size. The results showed that the average of the solution gap between TS solution and SPP solution is up to 28% (for small problems) and up to 18% for large problems. However, obtaining an optimal solution requires a large amount of computer time to produce the solution compared to obtaining approximate solutions using the TS approach. The use of Tabu Search for SRSP is novel and the results indicate that it is viable approach for large problems.