云南高校图书馆联盟文献共享服务平台- TARDINESS

TARDINESS: 作品数：17被引量：28H指数：2; 导出分析报告; 相关领域：自动化与计算机技术更多>>; 相关作者：贾春福孙旭闻振卫金霁更多>>; 相关机构：对外经济贸易大学南开大学南京科技职业学院苏州市职业大学更多>>; 相关期刊：《数学的实践与认识》《现代职业教育》《Journal of Systems Engineering and Electronics》《Journal of Donghua University(English Edition)》更多>>; 相关基金：国家自然科学基金高等学校学科创新引智计划更多>>

Minmax Common Due-Window Assignment Scheduling with Deteriorating Jobs: 《Journal of the Operations Research Society of China》2024年第3期681-693,共13页Dan-Yang Lv Jing Xue Ji-Bo Wang; supported by LiaoNing Revitalization Talents Program(No.XLYC2002017).; 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...; 关键词：SCHEDULING Single machine Deteriorating jobs Common due-window EARLINESS TARDINESS

Robust single machine scheduling problem with uncertain job due dates for industrial mass production被引量：4: 《Journal of Systems Engineering and Electronics》2020年第2期350-358,共9页YUE Fan SONG Shiji JIA Peng WU Guangping ZHAO Han; supported by the National Natural Science Foundation of China(61503211,U1660202)。; The single machine scheduling problem which involves uncertain job due dates is one of the most important issues in the real make-to-order environment. To deal with the uncertainty, this paper establishes a robust opt...; 关键词：ROBUST optimization single machine scheduling maximum TARDINESS UNCERTAIN DUE DATE

延迟时间最小化——一种特殊情形下的多任务排序研究: 《现代职业教育》2018年第5期84-85,共2页吴苏寒; 多任务处理与排序论的跨领域组合,可以解决现实生活中许多面临寻找'最优解'或'近似解'的问题。旨在讨论解延迟时间最小化问题。选取经典排序论模型,考察资源与工作之间通过合理的时间安排,以实现目标函数的要求。经典算法中常用SPT排序...; 关键词：多任务处理(multitasking) 排序论(scheduling) 总延迟时间最小(minimize TOTAL TARDINESS time)

Scatter Search Based Particle Swarm Optimization Algorithm for Earliness/Tardiness Flowshop Scheduling with Uncertainty被引量：2: 《International Journal of Automation and computing》2016年第3期285-295,共11页Jia-Can Geng Zhe Cui Xing-Sheng Gu; supported by National Natural Science Foundation of China(Nos.61174040 and 61104178);Shanghai Commission of Science and Technology(No.12JC1403400);the Fundamental Research Funds for the Central Universities; 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 fu...; 关键词：Earliness/tardiness （E/T） SCHEDULING fuzzy modeling scatter search （SS） particle swarm optimization （PSO）.

No-Wait Flowshops to Minimize Total Tardiness with Setup Times被引量：1: 《Intelligent Control and Automation》2015年第1期38-44,共7页Tariq Aldowaisan Ali Allahverdi; The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been inves...; 关键词：NO-WAIT FLOWSHOP Scheduling SETUP TIMES Total TARDINESS Simulated Annealing GENETIC Algorithm

Combined Timetabling Procedure and Complete Local Search for No-Wait Job Shop Scheduling with Total Tardiness被引量：1: 《Journal of Donghua University(English Edition)》2014年第2期83-91,共9页杨玉珍顾幸生; National Natural Science Foundations of China(Nos.61174040,61104178);Shanghai Commission of Science and Technology,China(No.12JC1403400);the Fundamental Research Funds for the Central Universities,China; The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in man...; 关键词：job shop scheduling NO-WAIT TIMETABLING TARDINESS complete local search with memory

Modified NSGA-II for a Bi-Objective Job Sequencing Problem被引量：1: 《Intelligent Information Management》2012年第6期319-329,共11页Susmita Bandyopadhyay; This paper proposes a better modified version of a well-known Multi-Objective Evolutionary Algorithm (MOEA) known as Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed algorithm contains a new mutation...; 关键词：JOB SEQUENCING Multi-Objective Evolutionary Algorithm (MOEA) NSGA-II (Non-Dominated Sorting Genetic Algorithm-II) TARDINESS DETERIORATION Cost

Scheduling problems on tardiness penalty and earliness award with simply linear processing time被引量：2: 《Journal of Shanghai University(English Edition)》2009年第2期123-128,共6页余英卢圳孙世杰何龙敏胡晶地; supported by the National Natural Science Foundation of China (Grant No.19771057); 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 polynomi...; 关键词：SCHEDULING single machine TARDINESS EARLINESS

工件具有相同加工时间和相同窗口交货期的单机E/T调度问题: 《数学的实践与认识》2009年第1期120-124,共5页金霁闻振卫; 国家自然科学基金(10871143); 研究工件具有相同的加工时间和相同的窗口交货期,目标函数是总费用函数的单机调度问题.给出了求解该问题的一个简洁的数学公式.; 关键词：单机调度窗口交货期 E/T(Earliness/Tardiness) 加工时间相同

A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time被引量：1: 《Journal of Shanghai University(English Edition)》2008年第3期204-209,共6页余英孙世杰何龙敏; 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 we...; 关键词：scheduling SINGLE-MACHINE linear decreasing processing time EARLINESS TARDINESS

TARDINESS