QQ客服 官方微博 反馈留言

浏览/检索结果: 共5条，第1-5条 帮助 限定条件 专题：西安交通大学    第一署名单位    第一作者单位    通讯作者单位     已选(0)清除 条数/页：5101520253035404550556065707580859095100   排序方式：请选择作者升序作者降序题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序 Optimizing the three-stage operating room scheduling problem with RVNS-GA 会议论文 作者:  Wu, Xiuli;  Xiao, Xiao;  Zhang, Linjuan 收藏  |  浏览/下载：7/0  |  提交时间：2019/11/19 Hybrid genetic algorithms  Operation stages  Optimization modeling  Preoperative preparation  Recovery stages  Scheduling problem  Variable neighborhood search  Variable neighbourhood search   Variable neighborhood search incorporating a new bounding procedure for joint replenishment and delivery problem 期刊论文 JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2018, 卷号: 69, 页码: 201-219 作者:  Wang, Lin;  Liu, Rui;  Liu, Shan 收藏  |  浏览/下载：4/0  |  提交时间：2019/11/26 delivery  Heuristics  variable neighborhood search  bound  joint replenishment   An estimation of distribution algorithm for scheduling problem of flexible manufacturing systems using Petri nets 期刊论文 APPLIED MATHEMATICAL MODELLING, 2018, 卷号: 55, 页码: 776-788 作者:  Wang, XinNian;  Xing, KeYi;  Li, XiaoLing;  Luo, JianChao 收藏  |  浏览/下载：4/0  |  提交时间：2019/11/26 Scheduling  Estimation of distribution algorithm  Flexible manufacturing system  Variable neighborhood search  Timed Petri net   The Electric Traveling Salesman Problem with Time Windows 期刊论文 TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 卷号: 89, 期号: [db:dc_citation_issue], 页码: 32-52 作者:  Roberti, R.;  Wen, M. 收藏  |  浏览/下载：4/0  |  提交时间：2019/12/02 Dynamic Programming  Time windows  Electric vehicles  General Variable Neighborhood Search  Traveling Salesman  Green logistics   Optimally sequencing mixed-model assembly lines optimally with skip utility work strategy 期刊论文 Zidonghua Xuebao/Acta Automatica Sinica, 2012, 卷号: 38, 期号: [db:dc_citation_issue], 页码: 259-269 作者:  Xiong, Fu-Li;  Yan, Hong-Sen 收藏  |  浏览/下载：3/0  |  提交时间：2019/12/10 Electromagnetism-like mechanisms  Hybrid algorithms  Mixed-model assembly lines  Sequencing  Sequencing problems  Skip utility work strategy  Strongly NP-hard  Variable neighborhood search