The problem of scheduling jobs with non - identical sizes on parallel batching machines is considered ; the objective is to minimize the maximum completion time ( makespan ) 摘要考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
In this paper , we firstly consider the problem of minimizing the maximum completed time on a single batch processing machine if the jobs have different processing times and sizes 摘要本文首次研究了工件有尺寸大小，有到达时间的分批排序问题，这里目标函数为工件的极大完工时间。
That is set to expand dramatically with the completion of extensive new administration facilities at the s ? bener strasse , currently scheduled for late spring 2008 整项计划将新管理大楼完工后有戏剧性的扩充，新管理大楼坐落于赛本纳大街，目前预定的完工时间是明年春季的晚些时候。
In this paper , we address the single machine scheduling problem with discretely controllable processing times , our objective is to minimize the makespan plus the total processing cost 摘要考虑工件加工时间离散可控的单机分批排序问题，目标函数是极小化最大完工时间与加工费用之和。
That is set to expand dramatically with the completion of extensive new administration facilities at the s & auml ; bener strasse , currently scheduled for late spring 2008 整项计划将新管理大楼完工后有戏剧性的扩充，新管理大楼坐落于赛本纳大街，目前预定的完工时间是明年春季的晚些时候。
In the first one the objective is to minimize the total resource consumption with makespan constraints , whereas in the second one the objective is to minimize makespan with the total resource consumption constraints 第二类问题的目标函数是在满足资源消耗总量限制条件下极小化最大完工时间。
Aiming at the irrationalities of static task scheduling in collaborative product development and design , a dynamic optimized scheduling method based on the least finish time is proposed 摘要针对协同产品开发中设计任务静态排序的不合理性，提出了一种基于最小化完工时间的任务优化动态排序方法。
Computational results reveal that the hybrid genetic algorithm can efficiently solve the considered problem and the reduction of makespan is related to the mutation rates and the number of generations 结果显示，混合式基因演算法可有效的求解测试问题，最大完工时间的降低和突变机率与世代数相关。
The key algorithm and idea of the production planning and dispatching based on equipment capacity and optimizing are studied by " start and complete time calculation of working procedure " and " anneal working procedure dispatch " 以工序开完工时间计算算法和退火工序算法为例论述了计划调度的关键算法和基于设备能力和优先级的计划编制思想。
A flexible job shop scheduling model in fuzzy production environment is given at first secondly , the best solution based on genetic algorithm according to the objective function of the minimum makespan is presented 摘要首先给出了模糊生产环境下柔性工作车间调度模型，然后以最小化最大完工时间为目标函数，提出了一种基于遗传算法的通用模糊调度算法。
