位置：成果数据库 > 会议 > 会议详情页
Efficient iterated greedy algorithm to minimize makespan for the no-wait flowshop with sequence depe
  • 所属机构名称：东南大学
  • 会议名称：2012 IEEE 16th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2012
  • 成果类型：会议
  • 相关项目：基于无冲突集的约束Job Shop调度优化算法
作者： 李小平|
同会议论文项目
基于无冲突集的约束Job Shop调度优化算法
期刊论文 8 会议论文 15
同项目会议论文
SOA-based method for cooperative tasks distribution in large-scale optimization environments
A copperative method for supervised learning in spiking neural networks
An effective heuristic for on-line tenant placement problem in SaaS
A dynamic resource allocation algorithm for database-as-a-service
An evolutionary algorithm for no-wait flowshop problems with flowtime minimization
A RFID-based dual-command method for unit-load warehouse systems
A resource & capability virtualization method for cloud manufacturing systems
An efficient metaheuristic for the blocking job shop problem with the makespan minimization
An effective evolutionary algorithm for pre-emptive resource-constrained project scheduling problems
A two-stage composite heuristic for dual cycling quay crane scheduling problem
Dynamic programming for services scheduling with start time constraints in distributed collaborative
A memory and variable neighborhood structure based complete local search for the no-wait job shop pr
Heuristic methods for minimizing resource availability costs in multi-mode project scheduling
An improved harmony search algorithm for blocking job shop to minimize makespan