Managing variances in manufacturing system design

The goal of this paper is to investigate how uncertainties in demand and production should be incorporated into manufacturing system design problems. We examine two problems in manufacturing system design: the resource allocation problem and the product grouping problem. In the resource allocation problem, we consider the issue of how to cope with uncertainties when we utilize two types of resources: actual processing capacity and stored capacity (inventory). A closed form solution of the optimal allocation scheme for each type of capacity is developed, and its performance is compared to that of the conventional scheme where capacity allocation and inventory control decisions are made sequentially. In the product grouping problem, we consider the issue of how we design production lines when each line is dedicated to a certain set of products. We formulate a mathematical program in which we simultaneously determine the number of production lines and the composition of each line. Two heuristics are developed for the problem.     

Resource allocation and target setting for parallel production system based on DEA

The paper proposes methodology for resource allocation and target setting based on DEA (data envelopment analysis). It deals with organization can be modeled as consisting of several production units, each of which has parallel production lines. The previous studies in the DEA literature only deal with reallocating/allocating organizational resources to production units and set targets for them. In their researches, the production unit is treated as a black box. In such circumstances, how to arrange the production at production unit level is not clear. This paper serves to generate resource allocation and target setting plan for each production unit by opening the black box. The proposed model exploits production information of production lines in generating production plans. The resulting plan has following characteristics: (1) the performance of each production lines are evaluated under common weights; (2) the weights chose for evaluation keep the efficiency of the entire unit not worse off; (3) the worst behaved production line in the production unit under evaluation are improved as much as possible. Finally, the real data of a production system extracted from extant literature are used to demonstrate the proposed method.     

Single-machine group scheduling with deteriorating jobs and allotted resource

In this paper, we consider single-machine scheduling problems with deteriorating jobs and resource allocation in a group technology environment. In the proposed model of this paper the actual processing time of a job depend on its starting time and the amount of resource allocated to it, and the actual setup time of a group depend on its starting time and the amount of resource allocated. Deterioration effect and two resource allocation functions are examined for minimizing the weighted sum of makespan and total resource cost. For the linear resource allocation function and the convex resource allocation function, we show that the problem remains polynomially solvable under certain conditions.     

Resource allocation for branch network system with considering heterogeneity based on DEA method

In this paper, we proposed a new DEA approach to allocate the resource in branch network system which is not covered by the existing resource allocation works under a centralized decision-making environment. The branch network system is typically appears in multi-national or multi-regional corporations, which has many branches across multiple locations. Given the spatial distribution of the production, we imposed additional restrictions on resource allocation and divided the resource inputs into three groups: fixed inputs, regional inputs that allocated to the branches in the same area and common resource that an additional resource allocated to all the branches. Then, we generalize the model further to accommodate technological heterogeneity due to the difference in the geographical locations of the branches. And the objective of the proposed models is to maximize the gross profits of the entire organization, which is a natural assumption for a for-profit organization. Finally, an example was presented to illustrate the proposed approach with heterogeneous technology is more practically feasible and superior than the prior approach with homogeneous technology.     

On centralized resource utilization and its reallocation by using DEA

The standard DEA model allows different DMU units to set their own priorities for the inputs and outputs that form part of the efficiency assessment. In the case of a centralized organization with many outlets, such as an education authority that is responsible for many schools, it may be more sensible to operate in the most efficient way, but under a common set of priorities for all DMUs. The algorithm that is used to do this, the centralized resource allocation model, does just this. We show that the centralized resource allocation model can be substantially simplified and we interpret the simplifications and show how the model works using real data of Spanish public schools. Apart from finding the best way to reallocate resource among the schools, it is shown that the most desirable operating unit is found to be a by-product of the estimation. This is useful information when planning new schools.     

不确定条件下环境友好型资源分配二层规划模型

本文讨论了不确定条件下环境友好型的资源分配问题:其中总公司作为上层领导者在各下属工厂间合理分配资源,以期获得最大收益的同时降低对环境的污染程度;而作为下层从属者的各工厂决定各自产量以期获得最大利润。该问题中的产品价格、生产成本、资源成本等被考虑为随机变量,环境污染指数被考虑为模糊变量,因而本文构造了不确定条件下的机会约束二层资源分配模型。运用等价定理对模型进行转换,并采用交互式满意度法将二层模型转化为单层模型以便求解。最后通过数值算例证实了模型和算法的可行性与有效性。此外,由于模型含有影响模型解的参数,故基于满意度和置信水平分别进行了灵敏度分析,进一步验证了所提出模型的科学性。     

Min-Max Optimization of Several Classical Discrete Optimization Problems

In this paper, we study discrete optimization problems with min-max objective functions. This type of problems has direct applications in the recent development of robust optimization. The following well-known classes of problems are discussed: minimum spanning tree problem, resource allocation problem with separable cost functions, and production control problem. Computational complexities of the corresponding min-max version of the above-mentioned problems are analyzed. Pseudopolynomial algorithms for these problems are provided under certain conditions.     

汇率的就业传导渠道及其效应测算——基于中国制造业面板数据的实证研究

文章研究了汇率的就业传导渠道,及其行业异质性。本文基于传统的生产函数理论,通过建模和理论分析得出:汇率影响就业的传导渠道主要有出口需求、资源配置和效率的三渠道。并基于中国制造业30个行业的2003年至2009年的面板数据,运用残差替代法和面板平滑机制转换回归,测算出各传导渠道在汇率影响就业过程中所起到的作用,结果表明:在整个传导机制中,出口需求对就业的作用较强,效率渠道和资源配置作用相对较弱;人民币升值对就业的总体效应为负效应,且传导机制中各渠道均具不同程度不同特征的行业异质性。     

具有恶化效应和凸资源分配关系的单机排序问题

研究工件加工时间具有恶化效应和凸资源关系的单机排序问题,其中工件的实际加工时间是其正常的加工时间,工件开工时间(具有恶化效应)及消耗资源量的函数。目标为在最大完工时间(总完工时间、总等待时间、完工时间总绝对差与等待时间总绝对差)小于或等于给定常数的条件下找到工件的最优排序和最优的资源分配使工件的总资源消耗量最少。在单机状态下,证明了此问题是多项式时间可解的,并给出了求解该问题的算法和数值实例。     

Interacting queues with server selection and coordinated scheduling—application to cellular data networks

We consider a system of parallel servers handling users of various classes, whose service rates depend not only on user classes, but also on the set of active servers. We investigate the stability under two types of allocation strategies: (i) server assignment where the users are assigned to servers based on rates, load, and other considerations, and (ii) coordinated scheduling where the activity states of servers are coordinated. We show how the model may be applied to evaluate the downlink capacity of wireless data networks. Specifically, we examine the potential gains in wireless capacity from the two types of resource allocation strategies.     

DEA models for resource reallocation and production input/output estimation

This paper discusses the “inverse” data envelopment analysis (DEA) problem with preference cone constraints. An inverse DEA model can be used for a decision making unit (DMU) to estimate its input/output levels when some or all of its input/output entities are revised, given its current DEA efficiency level. The extension of introducing additional preference cones to the previously developed inverse DEA model allows the decision makers to incorporate their preferences or important policies over inputs/outputs into the production analysis and resource allocation process. We provide the properties of the inverse DEA problem through a discussion of its related multi-objective and weighted sum single-objective programming problems. Numerical examples are presented to illustrate the application procedure of our extended inverse DEA model. In particular, we demonstrate how to apply the model to the case of a local home electrical appliance group company for its resource reallocation decisions.     

Decentralized Algorithm for Centralized Variational Inequalities in Network Resource Allocation

Decentralized algorithms would be useful for making network resource allocations in large-scale and complex system networks because such networks tend to lack centralized operators and are subject to continuous infrastructure improvements. In this paper, we consider a variational inequality for network resource allocation and devise a decentralized allocation algorithm for it. The proposed algorithm enables each user in the network to decide its own optimal resource allocation in cooperation with other users without using other users’ private information such as their utility functions. Moreover, we present a convergence analysis on the algorithm and apply it to the network resource allocation problem.     

随机网络计划在审计中的应用

审计作为市场经济的自我约束机制,在经济发展中有着不可或缺的责任.本文利用随机网络技术进行分析,旨在设计出高效率的审计活动方案.首先,利用PERT技术建立了确定型的审计活动模型,在此基础上给出了时间—资源优化下的最优人员分配方案;其次,利用GERT技术建立了随机型的审计活动模型,引入矩母函数和梅森公式进行GERT解析求解求出所需的工期等指标,同时采用蒙特卡罗模拟求解验证解析求解的准确性,为审计活动的工期控制提供了理论依据.最后对于工作时间确定的GERT模型,结合PERT和GERT两种技术对其进行简化分析,从而得到了时间—资源优化下的最优人员分配方案.     

Single-machine scheduling with convex resource dependent processing times and deteriorating jobs

In this study, we consider scheduling problems with convex resource dependent processing times and deteriorating jobs, in which the processing time of a job is a function of its starting time and its convex resource allocation. The objective is to find the optimal sequence of jobs and the optimal convex resource allocation separately. This paper focus on the single-machine problems with objectives of minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost, and a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. It shows that the problems remain polynomially solvable under the proposed model.     

LP models for pricing diffuse nitrate discharge permits

Nitrate discharges from diffuse agricultural sources significantly contribute to groundwater and surface water pollution. Tradable permit programs have been proposed as a means of controlling nitrate emissions efficiently, but trading is complicated by the dispersed and delayed effects of the diffuse pollution. Hence, markets in nitrate discharge permits should be carefully designed to account for the underlying spatial and temporal interactions. Nitrate permit markets can be designed similar to the modern electricity markets which use LPs to find the equilibrium prices because the two trading problems have close analogy. In this paper, we propose alternative LP models to find efficient permit prices for year-ahead markets. The model structure varies depending on the catchment hydro-geology and long-term goals of the community. We show how the market price structures are driven by the constraint structure under different environmental conditions. We discuss the physical and economic conditions required to assure consistent prices, the modeling of essential and optional constraints in an LP, and the problem of balancing resource allocation over time among delayed-response discharge units. We then extend the LP model to balance resource allocation over time and to improve the market performance.     

Optimal control policies for resource allocation in an activity network

In the paper a class of project-scheduling problems concerning the allocation of continuously divisible resources is considered. It is assumed that performing speeds of activities are continuous functions of the resource amount, and that the initial and terminal states of activities are known. For such mathematical models of project activities the problem of time-optimal resource allocation under instantaneous and integral constrains on a resource, and the problem of cost-optimal resource allocation with fixed project duration are formulated and a general solution concept is proposed. Necessary and sufficient conditions for the existence of a solution in particular cases are derived and properties of optimal schedules are given. The control policies for resource allocation are constructed for the example of the cost-optimal problem.     

核电资源替代煤电资源的临界时点分析模型

随着煤电资源的逐渐耗竭,传统电力资源的替代资源开发成为我国电力可持续发展的重要途径。为探讨核电资源替代煤电资源的经济规律,构建了一个电力资源社会价值评估模型。以电力资源社会价值最大化为目标,运用动态优化理论求解,得出核电资源替代煤电资源的临界替代时点,分析核电资源替代煤电资源的替代条件,剖析电力生产外部性对电力资源配置效率的影响程度及导致电力资源配置低效率的具体原因。认为电力生产部门的外部性影响电力资源的配置效率,阻碍核电资源替代煤电资源的发展进程。就电力生产部门的实际情况提出了相应的政策建议,以促进低碳清洁的核电资源替代煤电资源,实现环境、经济与电力可持续发展。     

Dynamic resource allocation in a multi-product make-to-stock production system

We consider optimal policies for a production facility in which several (K) products are made to stock in order to satisfy exogenous demand for each. The single machine version of this problem in which the facility manufactures at most one product at a time to minimise inventory costs has been much studied. We achieve a major generalisation by formulating the production problem as one involving dynamic allocation of a key resource which drives the manufacture of all products under an assumption that each additional unit of resource allocated to a product achieves a diminishing return of increased production rate. A Lagrangian relaxation of the production problem induces a decomposition into K single product problems in which the production rate may be varied but is subject to charge. These reduced problems are of interest in their own right. Under mild conditions of full indexability the Lagrangian relaxation is solved by a production policy with simple index-like structure. This in turn suggests a natural index heuristic for the original production problem which performs strongly in a numerical study. The paper discusses the importance of full indexability and makes proposals for the construction of production policies involving resource idling when it fails.     

Fuzzy programming and profit and cost allocation for a production and transportation problem

In this paper, we deal with a real problem on production and transportation in a housing material manufacturer, and consider a production and transportation planning under the assumption that the manufacturer makes multiple products at factories in multiple regions and the products are in demand in each of the regions. First, we formulate mixed zero–one programming problems such that the cost of production and transportation is minimized subject to capacities of factories and demands of regions. Second, to realize stable production and satisfactory supply of the products in fuzzy environments, fuzzy programming for the production and transportation problem is incorporated. Finally, under the optimal planning of production and transportation, we show a profit and cost allocation by applying a solution concept from game theory. Using actual data, we show usefulness of the fuzzy programming and a rational allocation scheme of the profit and cost.     

Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times

We consider unrelated parallel machines scheduling problems involving resource dependent (controllable) processing times and deteriorating jobs simultaneously, i.e., the actual processing time of a job is a function of its starting time and its resource allocation. Two generally resource consumption functions, the linear and convex resource, were investigated. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. This paper focus on the objectives of minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost, and a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. If the number of unrelated parallel machines is a given constant, we show that the problems remain polynomially solvable under the proposed model.