Scheduling problems on tardiness penalty and earliness award with simply linear processing time

In this paper, a single-machine scheduling model with a given common due date and simple linear processing times was considered. The objective is the total weighted tardiness penalty and earliness award. Some polynomial time solvable cases for this problem are given. A dynamic programming algorithm was provided and a branch and bound algorithm for general case of the problem was provided based on a rapid method for estimating the lower bound.

A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time

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.

Scatter Search Based Particle Swarm Optimization Algorithm for Earliness/Tardiness Flowshop Scheduling with Uncertainty

Considering the imprecise nature of the data in real-world problems, the earliness/tardiness （E/T） fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fuzzy scheduling model is established and then transformed into a deterministic one by employing the method of maximizing the membership function of middle value. Moreover, an effective scatter search based particle swarm optimization （SSPSO） algorithm is proposed to minimize the sum of total earliness and tardiness penalties. The proposed SSPSO algorithm incorporates the scatter search （SS） algorithm into the frame of particle swarm optimization （PSO） algorithm and gives full play to their characteristics of fast convergence and high diversity. Besides, a differential evolution （DE） scheme is used to generate solutions in the SS. In addition, the dynamic update strategy and critical conditions are adopted to improve the performance of SSPSO. The simulation results indicate the superiority of SSPSO in terms of effectiveness and efficiency.

Simulated Annealing for Earliness/Tardiness Production Planning Model

To describe the earliness/tardiness production planning problems in the JIT environment, a nonlinear semi\|infinite programming model was proposed in \. Due to a nonconvex objective function and many infinite constraints, the model is difficult to be solved by traditional methods. In this paper, simulated annealing method combined with a heuristic is developed. Numerical results shows that the present approach is very efficient. Theoretically, the developed method is an attempt to solve a continuous domain problem by using simulated annealing.

Genetic Algorithm for Scheduling Problem of Chemical Batch Process with Due Date Constraints

The intense competition in the current marketplace ha s forced firms to reexamine their methods of doing business, using superior manu facturing practices in the form of just-in-time (JIT), production with JIT pra ctices pursue completion on time and zero inventory, which is often instruct ed according to the custom’s demand or the sale contract. Earliness and tardine ss are undesirable because both of them will bring the extra cost, cost will als o be increased by some factors such as operation condition, intermediate storage , clean method, etc, to minimize the total cost is often the main scheduling objective, but sometime it is most important for factories to eliminate the tar diness cost in order to maintain the commercial credit and to avoid penalty, the refore, minimum of tardiness cost becomes the first objective. It is more import ant to select a reasonable objective by the actual condition during scheduli ng. In this paper scheduling problem of chemical batch process with due date is studied, two different intermediate storage policies and two different productio n modes are also discussed, production scheduling with different intermediate st orage policy and different production mode is proposed and the result is compare d. In order to complete all products within the due date, not only earliness and tardiness but also holding problem is considered, the objective is to selec t a proper intermediate storage policy and production mode and to minimize the c ost resulted by the earliness and tardiness, even the cost result by the interme diate storage. Scheduling with multiple stage and multiple machine is known as a NP-hard problem, mathematical program (MP) method, such as branch-and-bound (BAB), mixed integer linear program (MILP), etc, is often used to solve the sche duling problem. But as is well known, MP method is not good for combination opti mization, especially for large scale and complex optimal problem, whereas geneti c algorithm (GA) can overcome the MP method’s shortcoming and is fit for solvin g such scheduling problem. In this paper a modified genetic algorithm with speci al crossover operator and mutation operator is presented to solve this schedulin g problem. The results show such problem can be solved effectively with the pres ented method.

Number of Tardy Jobs of Single Machine Scheduling Problem with Variable Processing Time

The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved by 3 partition problem that if the problem is of ready time and common deadline constrained, its complexity is NP hard in the strong sense. Finally, a polynomial algorithm for solving unit processing time and common deadline problems is proposed.

A Heuristic for the Job Scheduling Problem with a Common Due Window on Parallel and Non-Identical Machines

In this paper, we give a mathematical model for earliness-tardiness job scheduling problem with a common due window on parallel and non-identical machines. Because the job scheduling problem discussed in the paper contains a problem of minimizing make-span, which is NP-complete on parallel and uniform machines, a heuristic algorithm is presented to find an approximate solution for the scheduling problem after proving an important theorem. Two numerical examples illustrate that the heuristic algorithm is very useful and effective in obtaining the near-optimal solution.

基于灰数描述的不确定工时作业车间E/T调度优化

针对不确定加工时间的作业车间调度问题,考虑每个工件的交货期窗口,旨在最小化工件提前/拖期成本和机器空闲成本。分别采用基本遗传算法和混合遗传算法进行求解,并比较两种算法的求解质量。通过灰色理论和模糊数理论对不确定加工时间分别建立调度模型,分析两种模型的优化程度和稳定性。结果表明,与基本遗传算法相比,引入按指定邻域结构进行局部搜索的混合遗传算法具有更好收敛能力;与模糊数方式相比,采用灰色理论能够更好地描述不确定加工时间,且在求解过程中也具有更好的适应性和稳定性。

“麦迪逊问题”与美国早期国家的发展

美国是一个联邦制国家,州先于联邦而存在,是独立的主权实体。在制宪建国过程中,州在新的政治秩序中占据什么地位是争论的焦点。著名的“麦迪逊问题”所涉及的不只是麦迪逊个人政治立场是否发生变化,更突出地反映了美国早期国家发展中的路径之争:是构建全新的联邦主权国家,还是尽可能捍卫以州主权为基础的联邦制国家。考察麦迪逊面临的挑战和遭遇的失败,并分析维护州主权的政治人物如何回应联邦主权国家的构建,可以看到迫于反对者的压力,麦迪逊在1787—1788年批准宪法之争时期就已经改变了其之前的国家主义立场,强调维护州主权。这种改变不是发生在联邦政府成立之后。从麦迪逊的视角来看,他此后捍卫州主权的行为是在维护批准宪法时期各方都认可的国家体制,反对联邦政府的集权扩张。

青少年早期睡眠问题的发展:性别差异及正性负性情绪的作用

为探讨青少年早期睡眠问题的发展轨迹,以及性别和正性负性情绪对其变化趋势的影响。本研究对1289名七年级学生进行历时两年共四次的追踪调查,采用潜变量增长模型分析,结果发现:(1)青少年早期睡眠问题呈曲线递增趋势,递增速度逐渐减缓,在起始水平和发展速度上均表现出显著的个体差异性;(2)在睡眠问题的起始水平上,女生显著高于男生,而在发展速度和加速度上,男女之间不存在显著差异;(3)正性情绪减缓特定时间点上青少年睡眠问题的发生,而负性情绪增强特定时间点上青少年睡眠问题的发生。研究结果表明青少年早期初始的睡眠问题并不决定后期的发展速度;性别和正性负性情绪对青少年睡眠问题发展的作用不同。

大学生心理问题早期发现途径和预防机制研究

对大学生心理问题的类型、成因以及早期发现大学生心理问题的困境等进行深入探讨和研究,从敏感性、专业性、接触性、针对性4方面挖掘大学生心理问题早期发现途径,并从自助和他助两个角度出发,制订能对心理问题进行早期预防、干预的长效机制。

家庭游戏干预对学龄早期儿童屏幕暴露和问题行为的影响

目的探讨家庭游戏干预对学龄早期儿童减少屏幕暴露和改善问题行为的效果。方法将138名屏幕暴露时间>1 h/d的学龄早期儿童随机分为试验组、对照组各69人。对照组采用常规健康教育,试验组采用常规健康教育和家庭游戏干预8周。分别于干预前和干预后采用屏幕暴露时间问卷、照顾者监控孩子使用电子产品问卷及Achenbach儿童行为量表评价干预效果。结果试验组和对照组分别有67人完成研究。干预后试验组家长监控使用电子产品行为得分显著高于对照组(P<0.05),儿童屏幕暴露时间显著低于对照组(P<0.05);两组儿童问题行为总分比较,差异无统计学意义(P>0.05)。结论家庭游戏干预可增强家长监控学龄早期儿童使用电子产品行为、减少学龄早期儿童屏幕暴露时间和改善其问题行为。

问题导向联合压疮预警干预机制在重症脑出血术后昏迷患者中的应用

目的:探讨问题导向联合压疮预警干预机制在重症脑出血术后昏迷患者中的应用效果,为临床护理提供依据。方法:选取2019年6月—2021年5月德阳市人民医院收治的84例重症脑出血术后昏迷患者作为研究对象,按照入院时间先后将其分为对照组和观察组,每组各42例。对照组实施常规护理干预,观察组在常规护理基础上实施问题导向联合压疮预警干预机制。比较两组患者压疮发生风险、压疮发生率及分期、术后临床效果(术后ICU治疗时间、术后机械通气时间)、护理满意度情况。结果:干预3 d后,观察组患者压疮发生风险明显低于对照组,差异有统计学意义(Z=2.299,P<0.05)。观察组患者压疮发生率及压疮分期明显低于对照组,差异有统计学意义(χ^(2)=4.141,P<0.05)。观察组患者术后ICU治疗时间、术后机械通气时间均明显短于对照组,差异有统计学意义(t=7.970、5.813,P<0.05)。干预后,观察组患者护理满意度明显高于对照组,差异有统计学意义(χ^(2)=6.574,P<0.05)。结论:问题导向联合压疮预警干预机制可降低重症脑出血术后昏迷患者的压疮风险,改善压疮情况,促进患者早日康复,提高护理满意度。

许少峰和增订版三册本《近代汉语大词典》

许少峰是一位自学成才的辞书编纂专家,一生经历坎坷,编著颇丰。他离世之前完成修订工作的《近代汉语大词典》增订本,增加条目4120条,在义项、例句、注音、字形、释义、排序等方面也多有改正,总体质量有明显提高。由于种种原因,该词典也存在一些缺憾,主要是有些条目释义不够精确。

早临床问题导学探究药理学临床实践新教学模式

目的本研究旨在探索并建构一种新型的药理学实践教学模式,即早临床问题导学,以提升学生的临床思维和实践能力。方法通过设计早临床问题导学实践案例,学生小组讨论药物应用分析等医疗问题。针对教学效果,进行及时的反馈和评估。结果实践案例表明,早临床问题导学有效激发了学生对于医学问题的深入思考,促使其更好地理解和运用所学知识,且学生反馈新模式教学各维度满意度评分均优于传统教学模式,差异有统计学意义(P<0.01)。结论早临床问题导学模式为药理学实践教学提供了一种新途径,突出对实际问题的解决,培养了学生的临床思维,为其将理论知识应用于实践打下了坚实基础。

基于问题解决模式的中医护理干预对早期帕金森病患者生活质量的效果观察

目的探讨以问题解决(ADOPT)模式为导向的中医护理干预对早期帕金森病患者生活质量的影响。方法选取2023年3-11月昆明市中医医院老年病科满足纳排标准的86例早期帕金森病患者,采用随机数字表法将其分为对照组与观察组,2组分别选择该科室的2个病区纳入,一病区为对照组(43例),二病区为观察组(43例)。对照组采取常规中医护理干预,观察组实施基于ADOPT模式的中医护理干预方案。结果干预前2组患者的自我管理能力得分、改良Hoehn-Yahr(H-Y)分级、生活质量评分比较,差异无统计学意义(P>0.05)。干预后,观察组患者的自我管理能力得分、Hoehn-Yahr(H-Y)分级、生活质量评分均优于对照组,差异有统计学意义(P<0.05)。结论ADOPT模式指导下早期帕金森病患者的中医护理干预方案可以提高患者自我管理能力、延缓疾病进展,进而改善患者的生活质量。

普适型地质灾害监测预警系统应用及存在问题——以西藏拉萨、林芝为例

地质灾害隐患监测预警已成为主动防控地质灾害的重要手段。2021年西藏自治区监测预警体系共建设灾害点位660处,安装设备3582台。预警体系的建设在一定程度上提高了西藏自治区地质灾害综合应急防治能力,但每年大量的预警误报问题却给监测预警工作带来极大困扰,严重影响其防灾减灾效果。文章以拉萨市、林芝市为例针对西藏自治区地质灾害监测预警点建设工作,结合近年来的科学研究和工作经验,提出了目前西藏自治区监测预警中存在专业监测经验不足,技术力量薄弱,各类预警系统林立,监测设备误报率偏高,成功案例少,数据质量不可靠,部分设备本区不宜使用等突出问题。为使已建成的监测预警点发挥应有的监测预警效用,目前亟待起草适合西藏自治区的监测预警详细技术指南,并整合各类预警系统,从而提高预警成功率。

上榆泉煤矿综放工作面回风隅角低氧原因分析及预测

针对上榆泉煤矿综放工作面回风隅角附近低氧问题开展分析研究,根据实地调研,对导致低氧现象发生的气压、温度、湿度主要因素进行实时监测并建立数据库,进而分析地表温度、大气压对工作面低氧现象影响途径和程度,提出对综放工作面低氧现象超前预测预警的理念,为综放工作面现场安全生产提供必要信息,也为采取低氧治理措施提供基础依据。

一种新调度类型及其在作业车间调度中的应用

研究改进遗传算法解决作业车间调度问题,问题染色体的编码采用基于工序的编码。针对传统的调度类型的局限性,提出全主动调度及其基于工序编码的产生机制。为了克服传统遗传算法求解调度问题易于早熟收敛的缺点,设计基于优先工序交叉(Precedence operation crossover,POX)和改进子代产生模式的遗传算法。用改进的遗传算法求解传统调度问题、交货期调度问题和提前/拖期(Earliness/Tardiness,E/T)调度问题,研究半主动、主动和全主动三种不同的调度解码机制对遗传算法提供解质量的影响。