共查询到18条相似文献，搜索用时 171 毫秒
1.
在现代生产管理中,合理安排工件的加工顺序使所有的工件准时完工极为重要．文中研究工件不允许拖期的单机分批调度问题,目标是使加工．总成本最小,目标函数不仅考虑了工件提前完工有提前惩罚成本,还考虑了批加工成本费用．提出了一种多项式时间的最优算法． 相似文献
2.
研究了工件有优先约束和尺寸大小关系的分批排序问题,这里目标函数为工件的极大完工时间,这类问题是NP—完备的.对工件加工时间相同和有特殊到达时间的情况给出了它的近似算法,并证明其最差性能比不超过2. 相似文献
3.
研究了工件有尺寸大小的一致性在线分批排序．就所有工件有两个到达时间ri,i=1,2(不妨设r1=0,r2=r)对于0时刻到达的工件中加工时间最大的批满足一定的约束条件下的一致性在线分批排序给出一个在线算法,并证明了算法的竞争比不超过2．357． 相似文献
4.
曹国梅 《常熟理工学院学报》2009,23(4):22-24
考虑极小化加权总完工时间的一类无界的不相容工件族分批排序问题,给出了最优排序的性质和算法,并加以证明．对工件有k个到达时间的情形,给出了一个复杂性为D（2^k-1nlogn）的启发式算法． 相似文献
5.
考虑极小化加权总完工时间的单机分族分批排序问题,给出了最优排序的性质和算法,并加以证明,对工件有k个到达时间的情形,给出了一个复杂性为O(2k-1nlogn)的启发式算法. 相似文献
6.
7.
石国春 《商丘师范学院学报》2010,26(12)
讨论了工件的加工时间依赖于工件位置的树约束单机排序问题,给出了目标函数为最大完工时间的多项式算法.结果表明,最大家庭树中的工件优先于其它家庭树中的工件加工,并且其工件要连续加工所得到的排序为最优排序. 相似文献
8.
韩翔凌 《廊坊师范学院学报(自然科学版)》2010,10(6)
讨论了分批排序中工件具有学习效应、目标函数为极小化加权总完工时间的几个问题,分别就所有工件的基本加工时间都相等的情况给出了几种算法,并证明了算法的最优性. 相似文献
9.
《佳木斯教育学院学报》2017,(2)
在经典排序模型中,我们往往假定机器必须加工所有的工件,并且它们的加工时间都是给定的。但是在许多现实的应用中,若某个工件的加工时间或者加工费用很大,我们就会考虑是否要加工该工件,我们既可以选择付出一定的费用而拒绝加工该工件也可以选择不付费而加工它。这时目标函数不再是传统的最大总完工时间,极小化最大完工时间,最大延迟等,而是要同时考虑费用,我们把这种排序称为可拒绝排序[1][2]。本文研究了工件带拒绝费用的单机分族分批排序问题。主要证明了问题1,sfg|family-jobs,rej|Cmax+∑j∈sej和1,sfg|family-jobs,rej,b|Cmax+jisej是NP-难的,给出了它们的近似算法。 相似文献
10.
讨论问题1| chains,B|Cmax具体可描述为:有m条链,其中一条链上有n个工件,其余的m-1条链上的工件数之和为常数k,且工件的加工时间不限制,目标函数为最大完工时间.我们对该问题B=2的情况进行了深入的探讨,在研究过程中首次提出“合成链“算法,给出了时间复杂性为O(nk)的多项式时间算法. 相似文献
11.
考虑了两台同类机极小化总完工时间的分批排序问题,给出了计算复杂性为O(n3)的动态规划算法,并将此算法推广到了工件具有学习效应的情况. 相似文献
12.
In this paper,a fabrication scheduling problem concerning the production of components at a single manufacturing facility was studied,in which the manufactured components are subsequently assembled into a finite number of end products. Each product was assumed to comprise a common component to all jobs and a unique component to itself.Common operations were processed in batches and each batch required a setup time.A product is completed when both its two operations have been processed and are available.The optimality criterion considered was the minimization of weighted flow time.For this scheduling problem,the optimal schedules were described in a weignted shortest processing time first(WSPT)order and two algorithms were constructed corresponding to the batch availability and item availability,respectively. 相似文献
13.
We consider a scheduling problem involving a single processor utilized by two customers with constant deteriorating jobs,i.e.,jobs whose processing times are an increasing function of their starting times.Traditionally,such scenarios are modeled by assuming that each customer has the same criterion.In practice,this assumption may not hold.Instead of using a single criterion,we examine the implications of minimizing an aggregate scheduling objective function in which jobs belonging to different customers are evaluated with their individual criteria.We examine three basic scheduling criteria:minimizing makespan,minimizing maximum lateness,and minimizing total weighted completion time.We demonstrate all the scheduling problems considered are polynomially solvable. 相似文献
14.
The permutation flow shop scheduling problems with deteriorating jobs and rejection on dominant machines were studied. The objectives are to minimize the makespan of scheduled jobs plus the total rejection penalty and the total completion time of scheduled jobs plus the total rejection penalty. For each objective, polynomial time algorithms based on dynamic programming were presented. 相似文献
15.
《Performance Improvement Quarterly》2017,29(4):343-373
The influence of interest on job completion time, ordinary and worthy job performance, and job satisfaction is investigated following the provision of job‐related prior knowledge. This quasiexperimental posttest research compared studies of low‐ and high‐value jobs. In Study 1, participants (n = 75) completed a dressing job (low value). In Study 2, participants (n = 71) completed a computer job (high value). Interest in the low‐value job was found to trigger significant job performance and job satisfaction, but no significant impact was noted on job completion time. However, worthy job performance (in which performance is evaluated by total cost spent to acquire desired output) of the lowvalue job was nonsignificant and inverse to job performance. Interest in the highvalue job was seen to significantly affect job completion time and job satisfaction, but not job performance. In contrast to Study 1, worthy job performance was consistent with job performance and seen as significant. The results are discussed, and further research studies are recommended. 相似文献
16.
A single machine scheduling problem involving fuzzy due dates and fuzzy precedence constraints is investigated. The fuzzy precedence reflects the satisfaction level with respect to precedence between two jobs. A membership function is associated with each job Ji, which describes the degree of satisfaction with respect to completion time of Ji. For the bi-criteria scheduling problem, an 0 （ n^3 ） algorithm is proposed for finding nondominated solutions. 相似文献
17.
王永和 《大连教育学院学报》2003,19(1):1-8
2002年是大连教育学院50年来实现历史性跨越的一年,在干训、中小学教师继续教育、各类教育教学教研指导等方面取得了令人瞩目的成绩。随着学院硬件建设任务的基本完成,自2003年始,大连教育学院的工作重心实行向内涵发展战略转移,弘扬"观念兴院、学术兴院、管理兴院"的办学理念,全面开创学院各项工作新局面 相似文献
18.
研究预防性周期维护策略下再制造系统中可中断和不可中断2类工件的单机调度问题.以最小化完工时间为目标,提出了LPT-LS算法,该算法首先按LPT(longest processing time)规则安排不可中断工件,然后按LS(list scheduling)规则安排可中断工件.并根据可中断工件的总加工时间(记为S2)分3种情况证明了该算法的最坏情况比,结论如下:当S2大于按LPT规则安排不可中断工件后机器的空闲时间时,最坏情况比为1;当S2介于分别按LPT规则和OPT(最优排序)规则安排不可中断工件后机器的空闲时间之间时,最坏情况比小于2;当S2小于按OPT规则安排不可中断工件后机器的空闲时间时,最坏情况比小于2.最后通过算例验证了结论的正确性. 相似文献