The complexity and approximation algorithm of three parallel machines scheduling problem with servers 带服务器的三台平行机排序问题的复杂性和近似算法
Genetic algorithm method based on combinatorial rules in identaical parallel machine scheduling problem 并行多机调度问题的一种基于组合规则的遗传算法
Single machine scheduling with precedence constraints and processing time dependent on starting time 具有优先约束和加工时间依赖开工时间的单机排序问题
A survey for the progress of semi on - line algorithms on parallel machine scheduling problems is made 摘要对半在线平行机排序问题的研究进展作了详细综述和进一步探讨。
Multi - rule single machine scheduling problems with discretely controllable processing times are considered 摘要讨论了工件具有离散可控加工时间的单机多准则下的排序问题。
The design and analysis of algorithms for the first class semi on - line parallel machine scheduling problems are considered 介绍它们定义和在不同机器环境和目标函数下半在线排序问题分类，以及第一类半在线模型的近似算法的设计及其竞争比分析。
Thirdly , we use the two models to study the dynamic single - machine scheduling problem prmp and develop on - line optimal dispatching rules , which consider only available information 西北工业大学硕士论文摘妥第四，我们研究了一般费用函数问题1 } r ， ， prmp } fma 、的动态在线排序问题
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 摘要考虑工件加工时间离散可控的单机分批排序问题，目标函数是极小化最大完工时间与加工费用之和。
In chapter 2 we study two parallel machines scheduling to maximize non - delay jobs . the problem is np - hard for it contains a sub problem equivalent to partition problem 第二章讨论两台平行机排序极大化按期完工工件数问题，由于它的一个子问题等价于划分问题，因而该问题是一个np -难的问题。
Fourthly , we use the two models to study the dynamic single - machine scheduling problem prmp fmax and develop on - line optimal dispatching rules , which consider only available information 考虑该问题在中断一恢复和两种中断一安装重复模型下的单机动态排序问题，给出了在这几种模型下的只考虑当前可用信息的在线调度规则
