CSpace

浏览/检索结果: 共12条,第1-10条 帮助

已选(0)清除 条数/页:   排序方式:
Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system 期刊论文
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 卷号: 283, 期号: 2, 页码: 441-460
作者:  Zhang, Sicheng;  Li, Xiang;  Zhang, Bowen;  Wang, Shouyang
收藏  |  浏览/下载:176/0  |  提交时间:2020/05/24
Scheduling  Flexible assembly job shop scheduling  Multi-objective optimisation  Meta-heuristics  Ant colony optimisation  
Heuristics for Online Scheduling on Identical Parallel Machines with Two GoS Levels 期刊论文
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2019, 卷号: 32, 期号: 4, 页码: 1180-1193
作者:  Cai Shuang;  Liu Ke
收藏  |  浏览/下载:189/0  |  提交时间:2020/01/10
Grade of Service (GoS) constraints  heuristic algorithm  online scheduling  parallel machine scheduling  
multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints 期刊论文
journaloftheoperationsresearchsocietyofchina, 2018, 卷号: 6, 期号: 3, 页码: 391
作者:  Cai Shuang;  Yang Ke;  Liu Ke
收藏  |  浏览/下载:220/0  |  提交时间:2020/01/10
Multi-objective Optimization of the Distributed Permutation Flow Shop Scheduling Problem with Transportation and Eligibility Constraints 期刊论文
Journal of the Operations Research Society of China,, 2018, 卷号: 6, 期号: 3, 页码: 391
作者:  Cai Shuang;  Yang Ke;  Liu Ke
收藏  |  浏览/下载:165/0  |  提交时间:2021/01/14
SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN 期刊论文
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2010, 卷号: 27, 期号: 4, 页码: 493-501
作者:  Zhang, Shu-Xia;  Cao, Zhi-Gang;  Zhang, Yu-Zhong
收藏  |  浏览/下载:114/0  |  提交时间:2018/07/30
Scheduling  discretely compressible release dates  approximation algorithm  makespan  
A PTAS for parallel batch scheduling with rejection and dynamic job arrivals 期刊论文
THEORETICAL COMPUTER SCIENCE, 2009, 卷号: 410, 期号: 27-29, 页码: 2732-2745
作者:  Cao, Zhigang;  Yang, Xiaoguang
收藏  |  浏览/下载:106/0  |  提交时间:2018/07/30
Scheduling  Parallel batch  Dynamic job arrivals  Rejection  PTAS  
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2008, 卷号: 16, 期号: 2, 页码: 119-126
作者:  Zhang, Yuzhong;  Cao, Zhigang
收藏  |  浏览/下载:107/0  |  提交时间:2018/07/30
scheduling  batching  non-identical job sizes  makespan  asymptotic PTAS  
On-line scheduling of small open shops 期刊论文
DISCRETE APPLIED MATHEMATICS, 2001, 卷号: 110, 期号: 2-3, 页码: 133-150
作者:  Chen, B;  Du, D;  Han, J;  Wen, JJ
收藏  |  浏览/下载:97/0  |  提交时间:2018/07/30
scheduling  on-line  open shop  preemption  competitive analysis  
Preemptive on-line scheduling for two uniform processors 期刊论文
OPERATIONS RESEARCH LETTERS, 1998, 卷号: 23, 期号: 3-5, 页码: 113-116
作者:  Wen, JJ;  Du, DL
收藏  |  浏览/下载:107/0  |  提交时间:2018/07/30
on-line scheduling  competitive ratio  preemption  uniform processors  
A new approximation algorithm for UET-scheduling with chain-type precedence constraints 期刊论文
COMPUTERS & OPERATIONS RESEARCH, 1998, 卷号: 25, 期号: 9, 页码: 767-771
作者:  Han, JY;  Wen, JJ;  Zhang, GC
收藏  |  浏览/下载:87/0  |  提交时间:2018/07/30
precedence constraints  parallel machines  makespan  approximation algorithm