基于地心天际球面坐标的低轨卫星通信网络簇结构协同工作机制设计

低轨LEO（Low earth orbit）卫星通信网络系统星间链路结构与链接关系十分复杂，如何实现该系统的高度可靠、高效工作是一件十分复杂和困难的工作。传统路由算法多选择分布式路由，忽略了卫星内部的分簇管理，在一定程度上，大大增加了算法的时间复杂度和空间复杂度。针对此问题，本文从LEO卫星通信网络的特征出发，运用空间通信技术，分簇规划技术与排队图示评审技术Q-GERT（Queuing graphic evaluation review technique），首先构建LEO卫星通信网络的地心天际球面坐标体系，搭建具有分簇架构的多层次通信网络；其次基于网络综合效能最优化，设计能够实现高度分布式协同通信业务管理的路由模型与算法；最后通过案例研究，表明本文所提工作机制的实用性与有效性。     

Scheduling Support Times for Satellites with Overlapping Visibilities

We consider the scheduling of ground station support times to low Earth orbit (LEO) satellites with overlapping visibilities. LEO satellites typically complete a revolution around the Earth in less than four hours at an altitude of a few hundred miles and are part of the critical infrastructure for natural resource management, crop yield estimation, meteorology, flood control, communication, and space research. Because these satellites are quite expensive to launch and operate, utilizing them in the best possible manner is of paramount importance for the agencies that own them. A ground station provides support time to a satellite to perform a variety of tasks when the satellite is visible to the station over a prespecified planning horizon; the payoff from providing such support is a function of the support time. When two or more satellites pass over the ground station, their visibility time windows may overlap. Thus, under overlapping visibilities, a relevant problem is that of scheduling ground station support time for each satellite with the objective of maximizing the total utility generated from supporting the satellites. We propose four basic scheduling models to address a variety of scenarios and investigate their computational complexities. For each model, we also identify special cases that are polynomially solvable.     

Inference in Dynamic Discrete Choice Models With Serially orrelated Unobserved State Variables

This paper develops a method for inference in dynamic discrete choice models with serially correlated unobserved state variables. Estimation of these models involves computing high‐dimensional integrals that are present in the solution to the dynamic program and in the likelihood function. First, the paper proposes a Bayesian Markov chain Monte Carlo estimation procedure that can handle the problem of multidimensional integration in the likelihood function. Second, the paper presents an efficient algorithm for solving the dynamic program suitable for use in conjunction with the proposed estimation procedure.     

Integrated Procurement Planning in Multi‐division Firms

For large multi‐division firms, coordinating procurement policies across multiple divisions to leverage volume discounts from suppliers based on firm‐wide purchasing power can yield millions of dollars of savings in procurement costs. Coordinated procurement entails deciding which suppliers to use to meet each division's purchasing needs and sourcing preferences so as to minimize overall purchasing, logistics, and operational costs. Motivated by this tactical procurement planning problem facing a large industrial products manufacturer, we propose an integrated optimization model that simultaneously considers both firm‐wide volume discounts and divisional ordering and inventory costs. To effectively solve this large‐scale integer program, we develop and apply a tailored solution approach that exploits the problem structure to generate tight bounds. We identify several classes of valid inequalities to strengthen the linear programming relaxation, establish polyhedral properties of these inequalities, and develop both a cutting‐plane method and a sequential rounding heuristic procedure. Extensive computational tests for realistic problems demonstrate that our integrated sourcing model and solution method are effective and can provide significant economic benefits. The integrated approach yields average savings of 7.5% in total procurement costs compared to autonomous divisional policies, and our algorithm generates near‐optimal solutions (within 0.75% of optimality) within reasonable computational time.     

MRP Planned Orders in a Multiple‐Supplier Environment with Differing Lead Times

This study examines a deterministic material requirements planning (MRP) problem where lead times at subsequent ordering moments differ. Adequate replenishment methods that can cope with lead time differences are lacking because of the order crossover phenomenon, that is, replenishment orders are not received in the sequence they are ordered. This study specifies how to handle order crossovers and recalculate planned order releases after an update of gross requirements. The optimal (s, S) policy is based on dynamic programing. The state space is kept to a minimum due to three fundamental insights. The performance of the optimal solution approach is compared with two heuristics based on relaxations and a benchmark approach in which order crossovers are ignored. A numerical analysis reveals that average cost savings up to 25% are possible if the optimal policy is used instead of the benchmark approach. The contribution of this study is threefold: (1) it generalizes theory on MRP ordering, allowing for lead time differences and order crossovers; (2) it develops new fundamental insights and an optimal solution procedure, leading to substantial cost saving; and (3) it provides good‐performing heuristics for a general and realistic replenishment problem that can replace the current replenishment methods within MRP.     

SCHEDULING JOBS ON PARALLEL PROCESSORS WITH DYNAMIC PROGRAMMING

The problem of scheduling jobs on M-parallel processors is one of selecting a set of jobs to be processed from a set of available jobs in order to maximize profit. This problem is examined and a dynamic programming solution is presented which decomposes it into a sequencing problem within an allocation problem. The computation required for solution is found to depend on the sequencing problem as it is affected by the waiting cost function. Various forms of the waiting cost function are considered. The solution procedure is illustrated by an example, and possible extensions of the formulation are discussed.     

一种考虑动态时间窗的满载问题模型及算法

针对时间约束在满载问题中的复杂性,建立了一个考虑装载时间和次序的具有动态时间窗的满载车辆调度模型,并给出了一个基于动态构造原理的启发式算法。该模型和算法改进了以往满载问题中对时间窗的考虑,使得求解更具有实际派车意义,并且该算法通过参数调整,经过少量迭代即可快速求得最小化总成本的满意解。     

Scheduling Truck Arrivals at an Air Cargo Terminal

We consider the scheduling of truck arrivals at an air cargo terminal. By coordinating arrivals of cargo delivery trucks with outbound flight departure schedules, some of the shipments can be transferred directly to the departing flights, while others will be stored at the terminal's storage facility and incur extra handling and storage costs. The objective is to obtain a feasible schedule so as to minimize the total cost of operations. We formulate the problem as a time‐indexed integer program and show that, even with limited number of unloading docks at the terminal, the problem is non‐trivial (NP‐hard in the strong sense). Our solution method includes an exact solution procedure to determine an optimal unloading sequence for the shipments carried by each truck, together with a Lagrangian relaxation‐based heuristic for assigning trucks to truck docks and determining truck arrival times. We conducted computational experiments to test the performance of our solution method. Computational results show that our method can generate near‐optimal solutions efficiently. Our simulation results indicate that the scheduling approach proposed in this paper has the potential to generate significant cost savings over a first‐come, first‐served approach currently used at the air cargo terminal that we observed.     

Joint production and subcontracting planning of unreliable multi-facility multi-product production systems

This article addresses the problem of joint optimization of production and subcontracting of unreliable production systems. The production system considered presents a common problem in the pharmaceutical industry. It is composed of multiple production facilities with different capacities, each of which is capable of producing two different classes of medications (brand name and generic). The resort to subcontracting is double: first, it involves the quantity of products received on a regular basis in order to compensate for insufficient production capacity in existing facilities, second, when needed, urgent orders are also launched in order to reduce the risk of shortages caused by breakdowns of manufacturing facilities. Failures, repairs and urgent delivery times may be represented by any probability distributions.The objective is to propose a general control policy for the system under consideration, and to obtain, in the case of two facilities, optimal control parameters that minimize the total incurred cost for a specific level of the customer service provided. Given the complexity of the problem considered, an experimental optimization approach is chosen in order to determine the optimal control parameters. This approach includes experimental design, analysis of variance, response surface methodology and simulation modeling. It allows the accurate representation of the dynamic and stochastic behaviors of the production system and the assessment of optimal control parameters. Other control parameters which represent the subcontracting are introduced and three joint production/subcontracting control policies (general, urgent, regular) are compared to one another. The proposed joint production/regular subcontracting control policy involves a cost decrease of up to 20%, as compared to results obtained by Dror et al. [1], who used a simplified control policy in addition to a heuristic solution approach for a real case study. This policy offers not only cost savings, but is also easier to manage, as compared to that proposed by Dror et al. [1]. Numerical examples and a sensitivity analysis are also performed to illustrate the robustness of the proposed control policy and the solution approach.     

Heuristic for scheduling in a two-machine bicriteria dynamic flowshop with setup and processing times separated

This paper addresses the two-machine bicriteria dynamic flowshop problem where setup time of a job is separated from its processing time and is sequenced independently. The performance considered is the simultaneous minimization of total flowtime and makespan, which is more effective in reducing the total scheduling cost compared to the single objective. A frozen-event procedure is first proposed to transform a dynamic scheduling problem into a static one. To solve the transformed static scheduling problem, an integer programming model with N ² + 5N variables and 7N constraints is formulated. Because the problem is known to be NP-complete, a heuristic algorithm with the complexity of O (N ³) is provided. A decision index is developed as the basis for the heuristic. Experimental results show that the proposed heuristic algorithm is effective and efficient. The average solution quality of the heuristic algorithm is above 99%. A 15-job case requires only 0.0235 s, on average, to obtain a near or even optimal solution.     

随机需求下联合选址-库存模型研究

研究了一类具有季节性需求特性的商品的联合选址-库存模型。在传统的无容量限制的固定费用设施选址问题中考虑了分销中心的运作库存和安全库存的影响,以及规模经济效应和风险分摊效应,同时考虑了季节性商品未来需求的不确定性,将订货决策作为模型的决策变量,建立了一类随机需求下以期望销售收益最大化为目标函数的联合选址-库存模型,拓展了已有的联合选址-库存模型。该模型是一个混合整数规划问题,给出了求解该问题的基于拉格朗日松弛算法的两阶段算法,最后通过随机生成四组不同规模的数值算例,得到的计算结果表明拉格朗日松弛算法可以有效地求解该问题。     

Lot‐sizing Decisions Under Limited‐time Price Reduction*

We consider the optimal lot‐sizing policy for an inventoried item when the vendor offers a limited‐time price reduction. We use the discounted cash flow (DCF) approach in our analysis, thereby eliminating the sources of approximation found in most of the earlier studies that use an average annual cost approach. We first characterize the optimal lot‐sizing policies and their properties, then develop an algorithm for determining the optimal lot sizes. We analytically demonstrate that the lot sizes derived using an average annual cost approach for the different variants of the problem are, in general, larger than the DCF optimum. While DCF analysis is more rigorous and yields precise lot sizes, we recognize that the associated mathematical models and the solution procedure are rather complex. Since simple and easy‐to‐understand policies have a strong practical appeal to decision makers, we propose a DCF version of a simple and easy‐to‐implement heuristic called the “Early Purchase” (EP) strategy and discuss its performance. We supplement our analytical developments with a detailed computational analysis and discuss the implications of our findings for decision making.     

多调机环境下的树枝形铁路专用线作业车同步取送优化

围绕服务铁路枢纽地方货物流的小运转作业系统，研究一类多调机环境下的树枝形铁路专用线作业车同步取送优化问题。考虑取送顺序间隔、调机牵引能力等约束条件，以调机作业均衡为上层优化目标，以调机取送成本和货车停留成本最小化为下层优化目标建立双重目标规划模型。根据模型特点，提出融合综合关联度和异步启发式过程的两阶段融合求解方法。该方法首先基于聚类划分思想，引入综合关联度确定调机最佳数量，并对作业区进行划分，从而为调机指派作业范围。进而基于迭代寻优思路，设计异步循环启发式过程，该过程根据多调机取送车作业特点赋予循环体表述，设计循环体更新规则，引入遗传算法中的交叉与变异操作对循环体进行寻优，进而导入人工鱼群聚群行为实现循环体二次寻优，从而完成所有调机在各自作业区内取送顺序的逐步寻优过程。最后，设计实验场景对所提出的两阶段算法进行过程验证，并设计不同规模试验进行对比测试，结果表明了所提算法的有效性和较优性。     

Multi-objective machine-component grouping in cellular manufacturing: A genetic algorithm

The cellular manufacturing system (CMS) is an important group technology (GT) application. The first step of CMS design is cell formation, generally known as machinecell formation (MCF) or machine-component (MCG). A genetic algorithm (GA) is a robust adaptive optimization method based on principles of natural evolution and is appropriate for the MCG problem, which is an NP complete complex problem. In this study, we propose a GA-based procedure to solve the MCG problem. More specifically, this study aims to minimize (1) total cost, which includes intercell and intracell part transportation costs and machines investment cots; (2) intracell machine loading imbalance; and (3) intercell machine loading imbalance under many realistic considerations. An illustrative example and comparisons demonstrate the effectiveness of this procedure. The proposed procedure is extremely adaptive, flexible, efficient and can be used to solve real MCG problems in factories by providing robust manufacturing cell formation in a short execution time.     

Coordinated Capacitated Lot‐Sizing Problem with Dynamic Demand: A Lagrangian Heuristic

Coordinated replenishment problems are common in manufacturing and distribution when a family of items shares a common production line, supplier, or a mode of transportation. In these situations the coordination of shared, and often limited, resources across items is economically attractive. This paper describes a mixed‐integer programming formulation and Lagrangian relaxation solution procedure for the single‐family coordinated capacitated lot‐sizing problem with dynamic demand. The problem extends both the multi‐item capacitated dynamic demand lot‐sizing problem and the uncapacitated coordinated dynamic demand lot‐sizing problem. We provide the results of computational experiments investigating the mathematical properties of the formulation and the performance of the Lagrangian procedures. The results indicate the superiority of the dual‐based heuristic over linear programming‐based approaches to the problem. The quality of the Lagrangian heuristic solution improved in most instances with increases in problem size. Heuristic solutions averaged 2.52% above optimal. The procedures were applied to an industry test problem yielding a 22.5% reduction in total costs.     

Processing in a multi-machine batch manufacturing system with sequence dependent cost

Many workcells in batch manufacturing systems are populated with multiple, nonidentical machines that perform similar tasks. Because of the size of a batch when a job arrives, it may be uneconomical to set up two or more machines to process the same job simultaneously. An economic decision has to be made as regards which machine in the cell to assign the job. Likewise, many multi-operation jobs can be processed using one of several feasible operation sequences that may lead to different total manufacturing costs. The cost differences are the result of several factors, among which are processing time and cost dependencies between operations, fixturing requirements, and material handling requirements. When the workcell machine selection decision is considered along with the operation sequencing decision, determination of the best machine in a cell and the best operation sequence for the batch is a non-trivial task. In this paper, we address the problem of selecting the best machine within a cell and the best operation sequence for a batch when operation cost is machine and sequence dependent. The problem is modeled mathematically and solved using a heuristic algorithm. The performance of the algorithm is compared with that of an exact solution procedure.     

A Framework for Facilitating Sourcing and Allocation Decisions for Make‐to‐Order Items

This paper provides a fundamental building block to facilitate sourcing and allocation decisions for make‐to‐order items. We specifically address the buyer's vendor selection problem for make‐to‐order items where the goal is to minimize sourcing and purchasing costs in the presence of fixed costs, shared capacity constraints, and volume‐based discounts for bundles of items. The potential suppliers for make‐to‐order items provide quotes in the form of single sealed bids or participate in a dynamic auction involving open bids. A solution to our problem can be used to determine winning bids amongst the single sealed bids or winners at each stage of a dynamic auction. Due to the computational complexity of this problem, we develop a heuristic procedure based on Lagrangian relaxation technique to solve the problem. The computational results show that the procedure is effective under a variety of scenarios. The average gap across 2,250 problem instances is 4.65%.     

Modeling cost-delivery trade-offs for distribution logistics by a generalized PVRP model

This article provides a mathematical model to support management in making decisions about cost-delivery trade-offs in the case of cost-delivery flexibilities in distribution logistics. The optimization problem can be modeled as a bi-objective periodic vehicle routing problem, which is known as NP-hard. In the periodic vehicle routing problem considered in this study, no delivery patterns are pre-defined, instead the patterns are the result of the optimization process of the model. In addition, delivery time flexibilities are incorporated in the model. A heuristic solution method for realistic problem sizes is based on the tabu search procedure, and a real case study illustrates the applicability of the solution concept.     

Generalization of multi-item,multi-retailer distribution system

The procedure developed by Muckstadt and Roundy is generalized. In a multi-echelon inventory system with a single warehouse and multi-retailers, some di erent items with constant demand rates are distributed. Considering set-up and holding costs as well as the cost of joint shipment of items from the warehouse to any retailer, the objective is to minimize the total costs of the system. In the proposed algorithm the assumption of nested policies is relaxed. The procedure introduced works for both nested and non-nested policies.     

Energy-oriented bi-objective optimization for the tempered glass scheduling

This paper investigates a real life bi-objective hybrid flow shop scheduling problem in an energy-intensive manufacturing system, in which glass is produced successively in cutting, printing and tempering stages. The problem aims to simultaneously optimize makespan and the total electricity cost under a time-of-use electricity pricing policy. The glass production has to respect the following environments: (i) the cutting and printing operations are processed in parallel machine environments; (ii) the tempering operation is processed on a batch machine; (iii) machine eligibility and setup time have to be considered in the cutting and printing stages; (iv) the whole manufacturing system is under a time-of-use electricity pricing policy. For the problem, an integer programming model is firstly proposed and shown to be strongly NP-hard. Then a model-based heuristic is adopted and a bi-objective differential evolution algorithm (BODE) is devised based on problem features. Computational experiments on randomly generated instances demonstrated that the BODE outperforms the model-based heuristic in terms of computation time and solution quality. Moreover, with mild increase on computation burden, the BODE significantly outperforms the classic NSGA II in terms of solution quality.