资源量与开工时刻限制下航空公司地面作业调度问题

根据航空公司实际地面作业背景,提出了一个资源量与开工时刻双重限制下的排序模型.已知有若干个任务和有限的资源量,每个任务有一个到达时刻及要求完工期限.以极小化最大的延误时间为目标给出了一个启发式的多项式算法,并界定了近似解与最优解的误差范围.     

变环境情形下Weibull分布分组数据的参数估计

本文研究了变环境情形下Weibull分布分组数据可靠性估计的参数估计问题。给出一种基于EM算法的变环境分组数据Weibull分布参数估计方法,所得估计量具有良好的收敛性,模拟结果表明方法的实践可用性。     

一种新的恒加试验下双参数指数型产品的可靠性分析

针对双参数指数型产品,在具有二项移走(即在每个观测时刻产品的移走数服从二项分布)的分组寿命试验下,研究了分组时刻的确定方法,推导出门限参数、寿命参数和移走概率的极大似然估计。进而,讨论了双参数指数型产品在具有二项移走的恒加寿命分组试验下的可靠性分析问题。利用加速寿命方程,给出了双参数指数型产品的可靠性估计。最后给出随机模拟例子验证了结论的正确性。     

同时具有学习效应和退化效应的单机排序问题

本文给出了一种同时具有一般化学习效应和退化效应的单机排序模型。在此模型中,工件的实际加工时间既与工件所在位置又与其开工时间有关,且工件在加工之后具有一个配送时间。其中学习效应是工件所在位置的函数,退化效应是工件开工时间的函数。证明了极小化最大完工时间和极小化总完工时间问题是多项式可解的,在满足一定的条件下,极小化加权总完工时间和极小化最大延误问题也是多项式可解的。推广了一些已有文献中的结论。     

A deterministic resource scheduling model in epidemic control: A case study

The resources available to tackle an epidemic infection are usually limited, while the time and effort required to control it are increasing functions of the starting time of the containment effort. The problem of scheduling limited available resources, when there are several areas where the population is infected, is considered. A deterministic model, appropriate for large populations, where random interactions can be averaged out, is used for the epidemic’s rate of spread. The problem is tackled using the concept of deteriorating jobs, i.e. the model represents increasing loss rate as more susceptibles become infected, and increasing time and effort needed for the epidemic’s containment. A case study for a proposed application of the model in the case of the mass vaccination against A(H1N1)_v influenza in the Attica region, Greece and a comparative study of the model’s performance vs. the applied random practice are presented.     

Single machine quadratic penalty function scheduling with deteriorating jobs and group technology

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. We consider the case of jobs whose processing times are a simple linear function of their starting time. The two objectives of scheduling problems are to minimize the weighted sum of squared completion times and the weighted sum of squared waiting times, respectively. We also provide polynomial time algorithms to solve these problems.     

Single-machine scheduling with deteriorating functions for job processing times

In many realistic scheduling settings a job processed later consumes more time than when it is processed earlier – this phenomenon is known as scheduling with deteriorating jobs. In the literature on deteriorating job scheduling problems, majority of the research assumed that the actual job processing time of a job is a function of its starting time. In this paper we consider a new deterioration model where the actual job processing time of a job is a function of the processing times of the jobs already processed. We show that the single-machine scheduling problems to minimize the makespan and total completion time remain polynomially solvable under the proposed model. In addition, we prove that the problems to minimize the total weighted completion time, maximum lateness, and maximum tardiness are polynomially solvable under certain agreeable conditions.     

一类速度不同的具有m台通用机的n组工件的排序问题

研究的目的在于解决实践中对多组任务的优化排序问题,即在最短的时间内完成所有给定的任务,由于这类问题往往都是NP完全问题,人们通常寻求其近似算法．文中提出了一种改进的LPT算法,利用。首先空闲”准则,讨论了将n组工件安排在n台速度不同的专用机,m台速度小于专用机的通用机上的C‰。。问题,得到了利用该近似算法所得的解T与最优解T＊的—个估计：T/T＊≤2＋（n-2）/（m＋1）