SINGLE-MACHINE

作品数：8被引量：15H指数：1
导出分析报告
相关领域：电气工程更多>>
相关作者：陆敏更多>>
相关机构：上海交通大学更多>>
相关期刊：《武汉理工大学学报》《Chinese Quarterly Journal of Mathematics》《Journal of the Operations Research Society of China》《Journal of Energy and Power Engineering》更多>>
相关基金：国家自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-8
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Single-Machine Preemptive Scheduling with Release Dates Involving the Total Weighted Late Work Criterion
《Journal of the Operations Research Society of China》2023年第3期693-706,共14页Zhi-Chao Geng Yuan Zhang 
the National Natural Science Foundation of China(Nos.12071442,11771406,and 11971443).
This paper investigates the preemptive scheduling with release dates on a single machine to minimize the total weighted late work.We firstly present an O(nlogn)-time algorithm for the single-agent problem with disagre...
关键词：Preemptive scheduling Total weighted late work Two agent Pareto frontier 
A Note on Single-Machine Lot Scheduling with Splittable Jobs to Minimize the Number of Tardy Jobs
《Chinese Quarterly Journal of Mathematics》2022年第4期412-421,共10页SHEN Hui-jun GENG Zhi-chao 
Supported by National Natural Science Foundation of China(Grant Nos.12071442,11971443,12271491)。
The single-machine lot scheduling problem with splittable jobs to minimize the number of tardy jobs has been showed to be weakly NP-hard in the literature.In this paper,we show that a generalized version of this probl...
关键词：Lot scheduling The number of tardy jobs Splitting jobs Strongly NP-hard 
Control of Neural Network Feedback Linearization Based on Chaotic Particle Swarm Optimization被引量：1
《Journal of Energy and Power Engineering》2010年第4期37-44,共8页S.X. Wang H. Li Z.X. Li 
This work is supported by National Natural Science Foundation of China （50776005）.
A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low ...
关键词：Chaos particle swarm algorithm OPTIMIZATION neural network single-machine infinite-bus system feedback linearization. 
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 
Single-machine scheduling of two activities with slack: CPM to minimize the total tardiness被引量：1
《Journal of Harbin Institute of Technology(New Series)》2007年第1期97-100,共4页李星梅 乞建勋 
Sponsored by the National Natural Science Foundation of China(Grant No.70671040)and Specialized Research Fund for the Doctoral Program of High Education(Grant No.20050079008).
In a CPM network, the longest path problem is one of the most important subjects. According to the intrinsic principle of CPM network, the length of the paths between arbitrary two nodes is presented. Furthermore, the...
关键词：CPM SCHEDULING SINGLE-MACHINE Activity float 
An Improved Ant Colony Algorithm for a Single-machine Scheduling Problem with Setup Times
《武汉理工大学学报》2006年第S3期956-961,共6页YE Qiang LIU Xinbao LIU Lin YANG Shanglin School of Management,Hefei University of Technology,Hefei 230009,China, 
Motivated by industrial applications we study a single-machine scheduling problem in which all the jobs are mutu- ally independent and available at time zero.The machine processes the jobs sequentially and it is not i...
关键词：DPBAC ALGORITHM ANT COLONY optimization ALGORITHM SINGLE-MACHINE SCHEDULING problem SETUP time 
The single-machine scheduling problems with deteriorating jobs and learning effect被引量：12
《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》2006年第4期597-601,共5页CHENG Ming-bao SUN Shi-jie 
In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimizat...
关键词：SCHEDULING SINGLE-MACHINE Learning effect Deteriorating jobs 
Determination of Optimal Due-Date for Single-Machine Scheduling with Dynamic Programming Approach
《Systems Science and Systems Engineering》2000年第3期373-379,共7页LU Xiang\|nan School of Management, Zhejiang University, 20 Yugu Rd. Hangzhou 310027, China 
This paper presents a method of dealing with the problem of assigning a due date which can either be known or unknown to a set of simultaneously available jobs and sequencing them on a single machine. The objective...
关键词：SCHEDULING Single  Machine System Dynamic Programming 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部