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

Scheduling Airline'S Ground Jobs Under Resource and Start Time Constraints

作　　者：靖德果[1] 许保光[1] 池宏[1] 

机构地区：[1]中国科学院科技政策与管理科学研究所,北京100190

出　　处：《数学的实践与认识》2012年第23期9-17,共9页Mathematics in Practice and Theory

摘　　要：根据航空公司实际地面作业背景,提出了一个资源量与开工时刻双重限制下的排序模型.已知有若干个任务和有限的资源量,每个任务有一个到达时刻及要求完工期限.以极小化最大的延误时间为目标给出了一个启发式的多项式算法,并界定了近似解与最优解的误差范围.This paper presents a scheduling model under resource and start time constraints based on airline＇s practical ground jobs. Given some jobs and finite resource amount, there is a reaching time and due time for each job. And each job has its resource requirement and processing time. This work provides a heuristic polynomial algorithm with the goal to minimize the maximum delay. And the difference range between optimum and our heuristic polynomial algorithm is derived.

关 键 词：地面作业 排序问题 资源限制 到达时刻 完工期限 

分 类 号：O223[理学—运筹学与控制论]