成组加工中带可分配工期的最大延误问题

研究成组加工中带可分配工期的最大延误问题的排序与工期分配,对于成组加工中带可分配工期的最大延误问题的不同模型,或给出其最优序．或证明其是NP-难问题．     

单机排序中带可分配工期的总误工问题的应急管理

对于机器排序的应急管理问题,Qi Xiang-tong等人进行了系统分析,得出了较好的结果.此文则考虑带可分配工期的总误工问题的应急管理问题.对于不同模型,或给出其最优序,或给出其近似解.     

带可分配工期的总误工问题的应急管理

本文考虑了单机排序中带可分配工期的总误工问题的应急管理问题.针对不同情况建立不同的模型,利用交换和动态规划的方法,得到了每个模型的最优解或近似解.     

带机器故障的两台机带权误工数排序问题

讨论机器带故障中断的两台平行机排序问题,工件加工时间均为单位时间,目标是极小化带权误工工件数.当转移时间t=0时给出了最优的算法.当t≠0时,给出了一个多项式时间的近似算法,并证明算法解与最优解至多相差一个带权误工数.     

任务工期最短条件下总效益最大的分配问题

本提出了以任务工期最短作为主要目标的分配问题，并给出了其最优解的求法。在此基础上，给出了任务工期最短条件下总效益值最大的分配问题的解法，最后又对该解法作一定的推广。     

具有相同批容量和相同工期的单机准时分批排序问题

研究具有相同批容量和相同工期的单机准时分批排序问题.这里相同批容量是指每批加工的工件数相同且恰为b个.准时排序要求工件在工期准时完工,提前或误工均受到惩罚.在两种分批方式下进行排序:继列分批和平行分批.目标函数为最小化加权总绝对误差和加权非准时惩罚.这里的权重不是工件自身所拥有的,而是工件所在的批一旦排在某个位置所获得的位置权重.证明了这些问题均可在O(nlogn)时间内解决.     

带权的误工排序问题的最优算法

研究工件有不同的权(重要性)、但是与工件加工时间有反向"一致性"关系,并且在保证工件的一个子集T中的工件必须不误工的前提下,使得带权的误工工件的个数(误工造成损失的费用)为最少的排序问题1∣T,(pi≤pj ) (wi≥wj)∣∑wjUj ;提出该问题的最优算法,证明提出的算法得到的排序是最优排序,而且证明这个最优排序在所有最优排序中不误工工件总的加工时间为最小.     

相容工件系统的最小化最大延迟与误工和的重新排序

在单机重新排序问题中,一个原始工件集已经排好顺序,使得给定的目标函数最小．当一个新的工件集到来时就会产生一些错位,决策者需要插入新工件到原来排序中而还不能过分打乱它们的顺序．该论文首先研究了当工件加工时间和工期相容时,在错位量限制的条件下最小化最大延迟问题;也研究了当工件加工时间相同或工件工期相同时,在错位量限制的条件下最小化误工和问题．对这些问题,给出了好的算法．     

带强制工期的可中断单机排序问题

工件带强制工期,指工件必须在已给定的工期内完工,不得延迟.这种环境在实际应用中随处可见.如果工件过早提前完工,意味着工件还需要保管,将会产生额外费用.本文讨论了在单机上,加工带准备时间与强制工期的n个可中断工件,在机器可空闲条件下,确定一个工件排序,使得提前完工时间和最小.先考虑了问题的复杂性,通过奇偶划分问题归约,证明了其是NP-complete的.而后,讨论了加工时间相等的特殊情形,由于工件不允许延迟,问题可能会无可行排序,因此提出了—个多项式时间算法,既能判定可行性,又能针对可行问题获得最优排序.     

加工时间是开工时间线性分段函数的单机总误工问题

研究工件加工时间是开工时间的线性分段函数的单机排序问题,其中工件的加工时间是开工时间的线性增加函数,但是有一个上界,在时刻T(T是已知常数)以后开始加工的工件,其加工时间不再因开工时间的推迟而增大,优化的目标是极小化总误工工件数.当工件的工期与加工时间满足某种一致性关系的时候,不管工件的加工时间是开工时间的简单线性分段函数,还是其基本加工时间是与恶化率有关的分段线性函数,证明这两种情况都是多项式时间可解的.     

地震期间应急资源调度方案的优化选取

应急资源的调度是地震救援工作的重点,为解决这个难题,本文构建了以时效性、伤亡性和经济性为三大分量的多目标函数,然后经过无量纲和Delphi加权处理,将其转化为单目标函数,并将其中的决策效用函数看成运筹学中指派问题的效率函数,最后运用匈牙利法计算出最大的目标函数值,从而得出最优的资源调度方案.与其他多目标的应急资源调度方法相比,本文构建的这种算法具有简易、实用的优点,可以说为地震期间应急资源调度方案的优化选取工作提供了一种切实、可行的途径.     

Local differentiable pole assignment

Given a general local differentiable family of pairs of matrices, we obtain a local differentiable family of feedbacks solving the pole assignment problem, that is to say, shifting the spectrum into a prefixed one. We point out that no additional hypothesis is needed. In fact, simple approaches work in particular cases (controllable pairs, constancy of the dimension of the controllable subspace, and so on). Here the general case is proved by means of Arnold's techniques: the key point is to reduce the construction to a versal deformation of the central pair; in fact to a quite singular miniversal one for which the family of feedbacks can be explicitly constructed. As a direct application, a differentiable family of stabilizing feedbacks is obtained, provided that the central pair is stabilizable.     

A contribution to quadratic assignment problems

We discuss special eases of the quadratic assignment problem (QAP) being polynomially solvable. In particular we give an algebraic condition for the cost; Matrices of a QAP which guarantees that it is equivalent with a linear assignment problem. Based on these results we develop an approximation algorithm for QAPs with non-negative symmetric cost matrices.     

Traffic assignment in communication satellites

A high capacity communication satellite interconnects scores of ground stations simultaneously. Under the Satellite-Switched/Time Division Multiple Access (SS/TDMA) system, each channel of the satellite is allocated to a pair of ground stations for a certain time period, after which the whole set of allocations (called a switch) is changed simultaneously. The problem we address is to minimize the time length of the entire sequence of switches, subject to a limit on the number of switches. We formulate this as a 3-index bottleneck-sum assignment problem, and solve it by a heuristic that obtains consistently better results than earlier methods based on different formulations.     

具有CON/SLK交货期指派的一类单机排序问题

研究工件的实际加工时间既具有指数学习效应,又依赖所消耗资源的准时制排序问题.在模型中,探讨了共同交货期(CON)和松弛交货期(SLK)两种情形.管理者的目标是确定最优序、最优资源分配方案和最佳工期(共同交货期或松弛交货期)以便极小化工件的总延误、总提前、总工期和资源消耗费用的总和.对于工件的实际加工时间是资源消耗量的线性函数的排序问题,通过将其转化为指派模型,给出了时间复杂性为O(n~3)的算法,从而证明该类排序问题是多项式时间可求解的.针对工件的实际加工时间是资源消耗量的凸函数的排序问题,也给出了多项式算法.     

A heuristic approach for airport gate assignments for stochastic flight delays

To make good flight to gate assignments, not only do all the relevant constraints have to be considered, but stochastic flight delays that occur in actual operations also have to be taken into account. In past research, airport gate assignments and stochastic disturbances have often been handled in the planning and the real-time stages separately, meaning that the interrelationship between these stages, as affected by such delays, has been neglected. In this research, we develop a heuristic approach embedded in a framework designed to help the airport authorities make airport gate assignments that are sensitive to stochastic flight delays. The framework includes three components, a stochastic gate assignment model, a real-time assignment rule, and two penalty adjustment methods. The test results are based on data supplied by a Taiwan international airport, and show that the proposed framework performs better than the current manual assignment process and the traditional deterministic model.     

QAPLIB – A Quadratic Assignment Problem Library

A collection of electronically available data instances for the QuadraticAssignment Problem is described. For each instance, we provide detailedinformation, indicating whether or not the problem is solved to optimality. Ifnot, we supply the best known bounds for the problem. Moreover we surveyavailable software and describe recent dissertations related to the QuadraticAssignment Problem.