欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
研究了目标函数是最小化最大完工时间的同类机调度问题,其中作业具有尾时间。此问题等价于最小化最大延迟时间的同类机问题,并被证明是NP-hard问题。为此问题构造了一种启发式算法LPDT,进而以LPDT算法求解结果为初始解构造了问题的可变邻域搜索算法LPDT-VNS。大量的随机数据实验用于验证算法的性能和效率。
英文摘要：
This paper considers the uniform parallel machine scheduling problem with delivery times so as to minimize makespan. This problem is equivalent to the uniform parallel machine scheduling problem to minimize the maximum lateness and is proved to be an NP-hard problem. We propose a new heuristic algorithm, named LPDT, and then build a variable neighborhood search algorithm, named LPDT-VNS, to improve the quality of the solutions that LPDT gave. The performance and efficiency of LPDT-VNS is tested on a large set of randomly generated instances. The results and analysis of experiments are reported and discussed.
同期刊论文项目
同项目期刊论文
The combination of dependence-based interval-valued evidential reasoning approach with balanced scor
Integrating gray system theory and logistic regressioninto case-based reasoning for safty assessment
Single-machine scheduling problem with resource dependent release dates to minimise total resource-c
Parallel machine scheduling problem to minimize the makespan with resource dependent processing time
An argument-dependent approach to determining OWA operator weights based on the rule of maximum entr
Consumer preference prediction by using a hybrid evidential reasoning and belief rule-based methodol
Applying a belief rule-base inference methodology to a guideline-based clinical decision support sys
Integrating classification capability and reliability in associative classification: A beta-stronger
Analyzing the applicability of Dempster’s rule to the combination of interval-valued belief structur
ASSESSMENT OF STRATEGIC R&D PROJECTS FOR CAR MANUFACTURERS BASED ON THE EVIDENTIAL REASONING APPROAC
期刊信息
位置：