咨询与建议

限定检索结果

文献类型

  • 95 篇 期刊文献
  • 33 篇 会议

馆藏范围

  • 128 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 119 篇 工学
    • 88 篇 计算机科学与技术...
    • 33 篇 控制科学与工程
    • 23 篇 电气工程
    • 22 篇 机械工程
    • 15 篇 软件工程
    • 2 篇 材料科学与工程(可...
    • 2 篇 信息与通信工程
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 交通运输工程
  • 74 篇 管理学
    • 74 篇 管理科学与工程(可...
    • 6 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 9 篇 理学
    • 6 篇 数学
    • 2 篇 生物学
    • 1 篇 物理学
  • 6 篇 经济学
    • 6 篇 应用经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 医学
    • 1 篇 基础医学(可授医学...

主题

  • 128 篇 iterated greedy ...
  • 26 篇 makespan
  • 13 篇 scheduling
  • 12 篇 blocking
  • 7 篇 local search
  • 7 篇 heuristic optimi...
  • 6 篇 heuristics
  • 5 篇 differential evo...
  • 5 篇 flowshop
  • 4 篇 multi-objective ...
  • 4 篇 metaheuristics
  • 4 篇 total flowtime
  • 4 篇 iterated local s...
  • 4 篇 automated guided...
  • 4 篇 constraint progr...
  • 4 篇 genetic algorith...
  • 4 篇 group scheduling
  • 4 篇 meta-heuristics
  • 3 篇 multi-objective
  • 3 篇 total tardiness

机构

  • 27 篇 liaocheng univ s...
  • 17 篇 shanghai univ sc...
  • 12 篇 yasar univ dept ...
  • 7 篇 tsinghua univ de...
  • 7 篇 huazhong univ sc...
  • 7 篇 liaocheng univ c...
  • 6 篇 nanyang technol ...
  • 5 篇 shanghai univ sc...
  • 4 篇 school of comput...
  • 4 篇 huazhong univ sc...
  • 3 篇 new jersey inst ...
  • 3 篇 northeastern uni...
  • 3 篇 liaocheng univ n...
  • 3 篇 univ alabama col...
  • 3 篇 sultan qaboos un...
  • 3 篇 nanjing univ aer...
  • 3 篇 hunan univ coll ...
  • 3 篇 nanchang univ sc...
  • 3 篇 yasar univ softw...
  • 2 篇 liaocheng univ e...

作者

  • 33 篇 pan quan-ke
  • 19 篇 tasgetiren m. fa...
  • 11 篇 gao liang
  • 7 篇 suganthan p. n.
  • 6 篇 sang hong-yan
  • 6 篇 han yuyan
  • 5 篇 wang yuhang
  • 5 篇 karabulut korhan
  • 5 篇 wang ling
  • 5 篇 wang yuting
  • 4 篇 li junqing
  • 4 篇 han yu-yan
  • 4 篇 shixin liu
  • 4 篇 oztop hande
  • 4 篇 liu shixin
  • 4 篇 jing xue-lei
  • 4 篇 kizilay damla
  • 4 篇 yuting wang
  • 3 篇 eliiyi deniz tur...
  • 3 篇 lin win-chin

语言

  • 113 篇 英文
  • 14 篇 其他
  • 1 篇 中文
检索条件"主题词=iterated greedy algorithm"
128 条 记 录,以下是41-50 订阅
排序:
A novel iterated greedy algorithm for detecting communities in complex network
收藏 引用
SOCIAL NETWORK ANALYSIS AND MINING 2020年 第1期10卷 1-17页
作者: Li, Wenquan Kang, Qinma Kong, Hanzhang Liu, Chao Kang, Yunfan Shandong Univ Sch Mech Elect & Informat Engn Weihai 264209 Shandong Peoples R China Univ Calif Riverside Dept Comp Sci & Engn Riverside CA 92521 USA
Community structure is one of the most important properties in complex networks. Detecting such communities plays an important role in a wide range of applications such as information sharing and diffusion, recommenda... 详细信息
来源: 评论
Minimizing Total Tardiness in the Distributed Flowshop Group Scheduling Problem with an iterated greedy algorithm
Minimizing Total Tardiness in the Distributed Flowshop Group...
收藏 引用
第34届中国控制与决策会议
作者: Zhi-Yuan Wang Yiran Pan Quan-Ke Pan School of Mechanical and Electrical Engineering and Automation Shanghai University School of Information Management Shanghai Lixin University of Accounting and Finance School of Computer Science Liaocheng University
This paper studies a distributed permutation flowshop group scheduling problem(DPFGSP) with a total tardiness criterion,which has significant applications in the current manufacturing *** considered problem can be bro... 详细信息
来源: 评论
An upgraded iterated greedy scheduling algorithm for distributed blocking flowshop group problem  35
An upgraded iterated greedy scheduling algorithm for distrib...
收藏 引用
35th Chinese Control and Decision Conference (CCDC)
作者: Ji, Qianhui Han, Yuyan Wang, Yuhang Wang, Yizheng Liaocheng Univ Sch Comp Sci Liaocheng Shandong Peoples R China
Owing to the needs of production technology, the demand for group scheduling models will further increase to save costs and time. Thus, the flowshop group scheduling problem (FGSP) has attracted a lot of attention, an... 详细信息
来源: 评论
An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2021年 169卷 114495-114495页
作者: Mao, Jia-yang Pan, Quan-ke Miao, Zhong-hua Gao, Liang Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan Peoples R China
In recent years, distributed scheduling problems have been well studied for their close connection with multi-factory production networks. However, the maintenance operations that are commonly carried out on a system ... 详细信息
来源: 评论
A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem
收藏 引用
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2021年 104卷 104375-104375页
作者: Chen, Shuai Pan, Quan-Ke Gao, Liang Sang, Hong-yan Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Liaocheng Univ Sch Comp Sci Liaocheng 252000 Shandong Peoples R China Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Peoples R China
We consider the distributed blocking flowshop scheduling problem (DBFSP) which is a meaningful generalization of the blocking flowshop scheduling problem in the distributed production environment. The objective of min... 详细信息
来源: 评论
An iterated greedy algorithm for Distributed Blocking Flowshop Problems with Makespan Minimization  39
An Iterated Greedy Algorithm for Distributed Blocking Flowsh...
收藏 引用
39th Chinese Control Conference (CCC)
作者: Chen, Shuai Pan, Quan-ke Hu, XiaoLu Tasgetiren, M. Fatih Shanghai Univ Sch Mech & Elect Engn & Automat Shanghai 200444 Peoples R China China Rural Technol Dev Ctr Beijing 100045 Peoples R China Yasar Univ Int Logist Management Dept Izmir Turkey
In this paper, we study a distributed blocking flowshop scheduling problem (DBFSP) that is an extension of the traditional blocking flowshop scheduling problem (BFSP), in which an additional decision of which factory ... 详细信息
来源: 评论
iterated greedy algorithm for Solving a New Single Machine Scheduling Problem  16
Iterated Greedy Algorithm for Solving a New Single Machine S...
收藏 引用
16th IEEE International Conference on Networking, Sensing and Control (ICNSC)
作者: Zhao, ZiYan Liu, ShiXin Zhou, MengChu Guo, XiWang Xue, JiaLun Northeastern Univ Coll Informat Sci & Engn State Key Lab Synthet Automat Proc Ind Shenyang 110819 Liaoning Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA Liaoning Shihua Univ Coll Comp & Commun Engn Fushun 113001 Peoples R China
This paper studies a new single machine scheduling problem with sequence-dependent setup time, release time, due time and group technology assumption originated from a wire rod and bar rolling process in steel plants.... 详细信息
来源: 评论
iterated greedy algorithm for Solving a Hybrid Flow Shop Scheduling Problem with Reentrant Jobs
Iterated Greedy Algorithm for Solving a Hybrid Flow Shop Sch...
收藏 引用
第32届中国控制与决策会议
作者: Qi Zhang Zheng Tian Sen Wang Shixin Liu State Key Laboratory of Synthetical Automation for Process Industries College of Information Science and EngineeringNortheast University Shanghai Baosight Software Co. Ltd.
This paper studies a hybrid flow shop scheduling problem with reentrant jobs from a copper strip cold rolling process in copper plants. The objective is to find a near-optimal job sequences to minimize makespan. A mix... 详细信息
来源: 评论
An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop
收藏 引用
APPLIED SOFT COMPUTING 2021年 99卷 106945-106945页
作者: Zou, Wen-Qiang Pan, Quan-Ke Tasgetiren, M. Fatih Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Liaocheng Univ Sch Comp Sci Liaocheng 252000 Shandong Peoples R China Yasar Univ Int Iogist Management Dept Izmir Turkey
In this paper, we address a multi-compartment automatic guided vehicle scheduling (MC-AGVS) problem from a matrix manufacturing workshop that has attracted more and more attention of manufacturing firms in recent year... 详细信息
来源: 评论
A multi-start iterated greedy algorithm for the minimum weight vertex cover P3 problem
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2019年 349卷 359-366页
作者: Zhang, Wenjie Tu, Jianhua Wu, Lidong Beijing Univ Chem Technol Dept Math Beijing 100029 Peoples R China Univ Texas Tyler Dept Comp Sci Tyler TX 75799 USA
Given a vertex-weighted graph G = (V, E) and a positive integer k >= 2, the minimum weight vertex cover P-k (MWVCPk) problem is to find a vertex subset F subset of V with minimum total weight such that every path o... 详细信息
来源: 评论