A moored underwater energy conservation system for profiling measurement

There is a need to obtain the hydrologic data including ocean current, wave, temperature and so on in the South China Sea. A new profiling instrument which does not suffer from the damage due to nature forces or incidents caused by passing ships, is under development to acquire data from this area. This device is based on a taut single point mid-water mooring system. It incorporates a small, instrumented vertically profiling float attached via an electromechanical cable to a winch integral with the main subsurface flotation. On a pre-set schedule, the instrument float with sensors is winched up to the surface if there is no strip passing by, which is defined by an on-board miniature sonar. And it can be immediately winched down to a certain depth if the sonar sensor finds something is coming. Since, because Of logistics, the area can only be visited once for a long time and a minimum of 10 times per day profiles are desired, energy demands are severe. To respond to these concerns, the system has been designed to conserve a substantial portion of the potential energy lost during the ascent phase of each profile and subsequently use this energy to pull the instrument down. Compared with the previous single-point layered measuring mode, it is advanced and economical. At last the paper introduces the test in the South China Sea.

逆向物流流量不确定闭环供应链鲁棒运作策略设计

考虑一类同时具有再分销、再制造和再利用的闭环供应链在逆向物流流量不确定环境下的运作问题.采用具有已知概率的离散情景描述逆向物流流量的不确定性,利用基于情景分析的鲁棒线性优化方法建立该闭环供应链的多目标运作模型.设计了一个数值算例,其结果验证了运作策略的鲁棒性.在该算例基础上,分析了逆向物流流量的大小对闭环供应链系统运作性能的影响.

供应链中物流及信息流管理

供应链管理使企业在变化的市场环境中有效地与其它企业合作 ,取得集体竞争优势。本文首先讨论了后勤学与供应链管理的定义和之间的关系。本文认为供应链管理的核心是物流与信息流的控制。物流控制决策主要包括操作层次的库存补充和运输路径规划 ,以及战略层次的设施地点规划。信息流管理跨越部门与企业的界限将相关的应用集成起来。动态联盟协调各企业内部的生产经营活动 ,战略性地决定物流与信息流的构形。

基于整车配送的多仓库开路VRPTW问题的研究与实现

以整车销售物流为背景,探讨多仓库带时窗约束的车辆路线安排问题的解决方法.提出了更为复杂的基于现实的细节性要求的多配送中心开路VRPTW问题模型,并将遗传算法产生部分解和评估完整解的优化解决方法和涌现交叉算子MX1引入到带时窗的多仓库VRP问题优化中,实现了快速全局优化.提出的开路混合配送方法有利于提高车辆满载率,降低回程空载率.同时实现了运输资源的优化配置,提高车辆利用率.计算机仿真实验证明了算法的可行性.

What's happening in European supply-chains?

Many multinational companies are supposedly viewing Europe as one region and re-shaping their approach to the supply of products to customers. Several factors are thought to be driving this trend, notably the degree of merger and acquisitions activity; the need for improved financial performance; the pressure to reduce inventories and costs, facilitated by improvements in communication and information technology systems. All of this is in the context of European market and monetary harmonisation. This paper investigates the extent and effect of the amanegement of supply chains on a pan-European baisis by multinational business. A survey was used to examine changes, both made and anticipated. to operational strategies, processes, organisational structures and physical infrastructure across a range of businesses and industry sectors. Cost reducation, driven by the need for profit and shreholder return, was found to be the priority for developments in supply chains.Many businesses reported consolidation of manufacturing and distribution activities whilst retaining discrete country-by-country organisational structures for managing customers and markets.Logistics Service Providers were seen in a traditional role as suppliers of commodity warehousing and transport services and lacked true pan-European capability. Despite the often-vaunted concept of a pan-European business model, individual businesses wwere seen to be negotiating their own path to balancing economies of scale with customers' service needs and expectations.

Postponement: An inter-organisational perspective

Yang, Ying, Yang, Biao, and Wijngaard, Jacob, 'Postponement: An inter-organisational perspective', International Journal of Production Research (2007) 45(4) pp.971-988 RAE2008

Impact of postponement on transportation: An environmental perspective

Yang, Ying, Yang, Biao, and Wijngaard, Jacob, ' Impact of postponement on transportation: An environmental perspective', International Journal of Logistics Management (2005) 16(2) pp.192-204 RAE2008

Business service quality in an e-commerce environment

Yang, Y., Humphreys, P., & McIvor, R. (2006). Business service quality in an e-commerce environment. Supply Chain Management: An International Journal, 11 (3), 195-201. RAE2008

Soldiers, Peasants, Industry and Towns. The Roman Army in Britain: A Welsh Perspective

Davies, Jeffrey. 'Soldiers, Peasants, Industry and Towns. The Roman Army in Britain: A Welsh Perspective', In: The Roman Army and the Economy (Amsterdam: J.C. Gieben, 2002), pp.169-203 RAE2008

O comportamento do consumidor de software de gestão e contabilidade das PMEs em Portugal, França e Espanha

Dissertação de Mestrado apresentada à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências Empresariais.

A qualidade como fator de diferenciação na logística farmacêutica e de produtos de saúde

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências Farmacêuticas

Cadeia de frio da distribuição farmacêutica

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências Farmacêuticas

Asynchronous Auction for Distributed Nonlinear Resource Allocation Problem

Resource Allocation Problems (RAPs) are concerned with the optimal allocation of resources to tasks. Problems in fields such as search theory, statistics, finance, economics, logistics, sensor & wireless networks fit this formulation. In literature, several centralized/synchronous algorithms have been proposed including recently proposed auction algorithm, RAP Auction. Here we present asynchronous implementation of RAP Auction for distributed RAPs.

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is NP-hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst-case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two-machine flow shop and the open shop problems with a single server are also shown to be NP-hard in the strong sense. However, we reduce the two-machine flow shop no-wait problem with a single server to the Gilmore-Gomory traveling salesman problem and solve it in polynomial time. (c) 2000 John Wiley & Sons, Inc.