跨境电商企业海外仓选址多目标优化研究

海外仓作为一带一路战略环境下的一种新型跨境物流模式,具有运输时间短、退换货快等特点。本文在跨境电商的背景下,综合考虑建仓成本、运输费用、运输时间和税费等因素,提出了海外仓选址多目标优化模型,随后基于分层序列法设计了二分搜索-最小费用流算法对该模型进行求解,并证明该算法在多项式时间内可以得到最优解,最后通过算例证实了该模型和算法的有效性和实用性,这为跨境电商海外仓选址提供了理论依据和决策支持。     

语言符号象似性之语用分析

本文从语用学的视角，通过联系礼貌原则、会话含义理论、间接言语行为及关联理论，对象似性研究中广泛被接受的四个原则，即数量象似性、顺序象似性、距离象似性和标记象似性进行了分析，找出了象似性与相关语用原则之间的诸多具有规律性的对应之处，并基本采用了运用多个语用原理诠释一个象似性原则的模式，旨在尝试将象似性研究提升至语用掌的研究范围，并构想在两套理论之间建立联系。     

A generalized procedure for minimizing makespan in a CNC environment

This paper presents the problem of scheduling N jobs, each manufactured in a number of settings, in order, on a CNC machine equipped with an automatic tool changer. A generalized procedure to minimize makespan in a CNC environment has been developed and tested on real industrial problems, considering possible constraints. It is worthy of mention that the procedure suggested finds an optimal solution of the problem discussed by Sule in a short and simplified manner. The step-by-step analysis shows the simplicity and flexibility of the proposed approach.     

NERJIT: Using Net Requirement Data in Kanban‐Controlled Jumbled‐Flow Shops

The bold lines that have separated the application of specific production planning and control techniques to specific production systems are being blurred by continuous advances in production technologies and innovative operational procedures. Oral communication among dispatchers and production units has given way to electronic communication between production planners and these units by continuous progress in information technologies. Current production literature alludes to the idea that, collectively, these advances have paved the way for application of Just‐In‐Time (JIT) production concepts, which were originally developed for mass production systems, in intermittent production systems. But this literature does not actually consider the possibility. This article presents a modification to JIT procedures to make them more suitable for jumbled‐flow shops. This article suggests providing real‐time information about net‐requirements for each product to each work center operator for setting production priorities at each work center. Simulation experiments conducted for this study show that using Net‐Requirements in JIT (NERJIT) reduces customer wait time by 45–60% while reducing inventory slightly. The analysis of work centers’ input and output stock‐point inventories shows that using the information about net‐requirements results in production of items that are in current demand. NERJIT results in smaller input stock‐point inventory and availability of products with higher priority in the output stock‐points of work centers.     

马克思把握历史过程的双向考察方法

所谓双向考察方法,是指依据历史过程的走向而展开的不同向度的把握历史过程的方法,它包括逆向考察和顺向考察两类共四种。它们分别是从“现在”向“过去”和从“未来”向“现在”的逆向考察,从“现在”向“未来”和从“过去”向“现在”的顺向考察。马克思运用该方法,分别对历史过程中的自然次序、因果关系和发展次序进行了考察,而非单纯由果溯因的“从后思索”。在建构其理论体系、进行社会批判中,双向考察方法发挥了重要作用。     

公路建设项目的模糊排序和投资决策优化

本文论述了公路建设项目排序的评判指标,在运用模糊贴近度原理,分析确定各待建项目建设迫切性的基础上,采用整体投资决策优化模型,对公路网规划方案中建设项目的序列安排问题进行了探讨,收到了较好的效果．     

序列论与高校二级学院领导班子建设

随着高校的不断发展,二级学院的自主权越来越大,在整个学校发展中承担的责任也越来越重。这就要求组织部门运用序列论的理论将二级学院领导班子组合好,恰到好处地做好排列,适时位移,使每个二级学院的领导班子成员都能够人尽其才、才尽其用,从而更好地发挥二级学院的作用,促使各二级学院特色交融,互相借鉴先进的管理理念,为学校的发展奠定良好的基础。     

中国贸易自由化的可持续发展战略研究

一、引言实际汇率是贸易品价格与非贸易品价格之比［１］。实际汇率的这个定义已被越来越多的文献所采用［２］。其基本涵义是：贸易品的生产或消费与非贸易品的生产或消费互为机会成本。贸易品价格与非贸易品价格之比是引导资源在这两大部门之间进行配置的关键信号。如果...     

Value‐Driven Creation of Functionality in Software Projects: Optimal Sequencing and Reuse

We study the problem of optimally sequencing the creation of elements in a software project to optimize a time‐weighted value objective. As elements are created, certain parts of the system (referred to as “groups”) become functional and provide value, even though the entire system has not been completed. The main tradeoff in the sequencing problem arises from elements that belong to multiple groups. On the one hand, creating groups with common elements early in the project reduces the effort required to build later functionality that uses these elements. On the other hand, the early creation of such groups can delay the release of some critical functionality. We formulate the element sequencing problem and propose a heuristic to solve it. This heuristic is compared against a lower bound developed for the problem. Next, we study a more general version of the element sequencing problem in which an element requires some effort to be made reusable. When a reusable element is used in another group, some more effort is needed to specialize the element to work as desired in that group. We study reuse decisions under a weighted completion time objective (i.e., the sum of the completion time of each group weighted by its value is minimized), and show how these decisions differ from those under a traditional makespan objective (i.e., only the final completion time of the project is minimized). A variety of analytical and numerical results are presented. The model is also implemented on data obtained from a real software project. A key finding of this work is that the optimal effort on reuse is never increased (typically lowered) when a weighted completion time objective is used. This finding has implications for managing reuse in projects in which user value influences the order in which functionality is created.     

Games and Mechanism Design in Machine Scheduling—An Introduction

We survey different models, techniques, and some recent results to tackle machine scheduling problems within a distributed setting. In traditional optimization, a central authority is asked to solve a (computationally hard) optimization problem. In contrast, in distributed settings there are several agents, possibly equipped with private information that is not publicly known, and these agents must interact to derive a solution to the problem. Usually the agents have their individual preferences, which induces them to behave strategically to manipulate the resulting solution. Nevertheless, one is often interested in the global performance of such systems. The analysis of such distributed settings requires techniques from classical optimization, game theory, and economic theory. The paper therefore briefly introduces the most important of the underlying concepts and gives a selection of typical research questions and recent results, focusing on applications to machine scheduling problems. This includes the study of the so‐called price of anarchy for settings where the agents do not possess private information, as well as the design and analysis of (truthful) mechanisms in settings where the agents do possess private information.