带学习效应的单机成组排序问题

考虑了在工件具有学习效应的条件下,目标函数为最大完工时间和总完工时间的单机成组排序问题.对这两个问题分别给出了多项式时问算法并证明了其算法的最优性.     

两类单机成组排序的问题

讨论了单机成组排序问题的加权总完工时间和最大延迟时间的极小化问题.并分别给出了算法.对于单杌成组排序误工总数问题,通过构造函数,利用动态规划方法给出其算法.     

单机最小化加权总完工时间的产品加工问题

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.     

排列组合中分配问题的求解策略

解排列组合中的分配问题时，同学们普遍感到困难，不知如何下手，或是因“有序、无序”不清或是乱用“原理”等原因而致错，为突破这一难点，下面谈谈解决此类问题的求解策略．     

两个加工时间恶化的半线性平行机排序问题的启发式MBLS 算法

The combination of online or semi-online with deterioration jobs has never been researched in scheduling problems. In this paper, two semi-online parallel machine scheduling problems with linear deterioration processing time are considered. In the first problem, it is assumed that the deterioration rates of jobs are known in an interval, that is, bj ∈[0, α], where 0 〈α≤ 1 and bj denotes the linear deterioration rate. In the second problem, it is assumed that the largest deterioration rate of jobs is known in advance, that is, b = max1≤j≤n {bj }. For each of the two problems, a heuristic MBLS algorithm is worked out and its worst-case ratio is analyzed. At the same time, the worst-case ratio of the list （LS） algorithm is investigated and it is proved that all the ratios are tight.     

工件加工时间退化且可拒的带优势关系流水作业问题的动态规划算法

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.     

高三政治课堂教学中问题设置探析--以“个人收入的分配”一课为例

提出问题、解决问题是很多中学教师都采用的教学方法。简单地说．就是以问题为载体贯穿教学过程．使学生在设问和释问的过程中萌生自主学习的动机和欲望．进而逐渐养成自主学习的习惯．并在实践中不断优化自主学习的方法．提高自主学习能力的一种教学方法。问题教学法充分体现了学生的主体地位．能有效地激发学生自主学习的主动性和积极性。采用问题教学法关键是如何设置问题。问题一般依据教材设置．依据学生知识水平设置。     

模糊交货期和模糊优先下的单机调度问题

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.     

与开工时间有关的加工时间的超前有奖迟后受罚的排序问题的动态规划算法

In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.     

单机数控加工的经济批量分析

本文分析了单机数控加工的经济批量的概念、变动范围以及影响因素。结论表明：准确选择数控机床加工的工件和准确选择数控机床的功能,是保证数控加工经济性的重要环节。