期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Minmax Common Due-Window Assignment Scheduling with Deteriorating Jobs
1
作者 Dan-Yang Lv Jing Xue ji-bo wang 《Journal of the Operations Research Society of China》 EI CSCD 2024年第3期681-693,共13页
This paper investigates the common due-window assignment scheduling problem with deteriorating jobs on a single machine in which the processing time of a job is a proportional function of its starting time.The goal is... This paper investigates the common due-window assignment scheduling problem with deteriorating jobs on a single machine in which the processing time of a job is a proportional function of its starting time.The goal is to minimize the maximum value of earliness and tardiness penalties,as well as due-window location cost,and size cost.Depending on whether the location and size of due-window are known,this paper studies three relevant cases,all of which are solvable in polynomial time. 展开更多
关键词 SCHEDULING Single machine Deteriorating jobs Common due-window EARLINESS TARDINESS
原文传递
SCHEDULING JOBS WITH GENERAL LEARNING FUNCTIONS 被引量:3
2
作者 Li-Yan wang Jian-Jun wang +1 位作者 ji-bo wang En-Min FENG 《Journal of Systems Science and Systems Engineering》 SCIE EI CSCD 2011年第1期119-125,共7页
This paper deals with single-machine scheduling problems with a more general learning effect based on sum-of-processing-time. In this study, sum-of-processing-time-based learning effect means that the processing time ... This paper deals with single-machine scheduling problems with a more general learning effect based on sum-of-processing-time. In this study, sum-of-processing-time-based learning effect means that the processing time of a job is defined by a decreasing function of the total normal processing time of jobs that come before it in the sequence. Results show that even with the introduction of the sum-of-processing-time-based learning effect to job processing times, single-machine makespan minimization problems remain polynomially solvable. The curves of the optimal schedule of a total completion time minimization problem are V-shaped with respect to iob normal orocessinz times. 展开更多
关键词 SCHEDULING single machine learning effect MAKESPAN total completion time
原文传递
Solid Solute Regularity of La Atom inα-Fe Supercell by First-principles
3
作者 Cai-xia wang Jian YANG +4 位作者 Sha LIU Xiao-lei XING ji-bo wang Xue-jun REN Qing-xiang YANG 《Journal of Iron and Steel Research International》 SCIE EI CAS CSCD 2016年第11期1213-1218,共6页
The structure stability, elastic property and electronic structure of a-Fe supercell with La atom were inves- tigated by first-principles, in which, generalized gradient approximation (GGA) with the Perdew Burke Ern... The structure stability, elastic property and electronic structure of a-Fe supercell with La atom were inves- tigated by first-principles, in which, generalized gradient approximation (GGA) with the Perdew Burke Ernzerhof (PBE) was used as exchange-correlation functional, a-Fe supercells with La atom include a-Fe supercell with La atom in octahedral interstitial solid solute (La-OISS), that with La atom in tetrahedral interstitial solid solute (La-TISS) and that with La atom in substitutional solid solute (La-SSS). The results show that the La-SSS a-Fe supercell is more stable than La-OISS one. The resistance to volume change, reversible deformation and stiffness of La-OISS a-Fe supercell are stronger than those of La-SSS one. Moreover, the degrees of anisotropy and ionization in La-SSS a-Fe supercell are both stronger than those in La-OISS one. The bonding strength between La atom and Fe atom in La-SSS a-Fe supercell is larger than that in La-OISS one. 展开更多
关键词 La atom a-Fe supercell solid solution FIRST-PRINCIPLES bonding strength
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部