1) open-shop
自由作业
1.
On the scheduling problem of two machine open-shop;
关于一类两台机器自由作业的排序问题
2.
Dense Schedules for Open-shop with Job s Release Date;
工件有到达时间的两机器自由作业稠密时间表(英文)
3.
On the Total Flow-Time Problem of Two Machine Open-Shop;
关于二台机器自由作业的总流程问题
2) Open Shop
自由作业
1.
The two machine open shop problem with delays and release times is considered and it is proven that the problem is very NP difficult by making up a workpiece.
研究了具有准备时间和延迟时间的自由作业问题 。
2.
For an open shop problem, if the principle of avoiding unnecessary idleness is applied to arrange available jobs for the schedule construction, a dense schedule is obtained.
对于自由作业问题 ,如果从初始时刻开始 ,逐步在每个机器安排任一可以加工的工件 ,避免不必要的空闲 ,所得的安排称为稠密时间表。
3.
This paper is concerned with the makespan problem of scheduling groups of jobs in two machine open shop.
讨论关于工件组的两机自由作业时间表的加工全长问题。
3) open shop scheduling problem
自由作业时间表
1.
This paper considers the open shop scheduling problems with job priorities and release times.
研究了具有优先权的自由作业时间表问题,在工件具有准备时间的条件下,给出一种新的启发式算法,其最坏性能比不超过2,猜想该算法的紧界是2-2/(m+1),其中m是机器的台数。
4) Open Shop Scheduling
自由作业排序
5) open-shop problem
自由作业问题
1.
We consider the open-shop problem with release times .
研究具有准备时间的自由作业问题 ,给出一种简单的启发式算法 ,证明在此启发式算法下 ,最坏性能比是 2 - 1/m(其中m是机器的台数 ) ,且上界是紧的 。
6) free action
自由作用
1.
By making use of the computer,we determine upper bounds for the number of orientation- reversing free actions of finite groups on closed orientable surfaces T~(nr+1)and all finite groups which act orientation-reversing freely on closed orientable surfaces T(nr+1)with low genus or T~p such that p-1 is a prime.
本文借助于计算机编程给出了有限群在可定向闭曲面T~(nr+1)上反向自由作用个数的上界,同时决定了反向自由作用于小亏格闭曲面T~(nr+1)上的有限群以及p-1为素数时反向自由作用于闭曲面T_p上的有限群。
2.
In the first chapter, we mainly discuss free actions on closed orientable surfaces by finite groups.
第一章,讨论有限群在2维可定向闭曲面上的自由作用。
补充资料：兵棋作业(见想定作业)
兵棋作业(见想定作业)
war gaming exercise
bingqi zuoye兵棋作业(war ga而ng exercise)见想定作业。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条