位置：成果数据库 > 会议 > 会议详情页
A composite algorithm for total completion-time minimization in large flow shop scheduling
  • 所属机构名称：东南大学
  • 成果类型：会议
  • 相关项目：基于目标增量的大规模无等待调度复合启发式算法
同会议论文项目
基于目标增量的大规模无等待调度复合启发式算法
期刊论文 26 会议论文 17
同项目会议论文
Meta-Heuristic for No-Wait Job Shops with Makespan Minimization
A new hybrid Genetic Algorithm for the bi-criteria no-wait flowshop scheduling problem with makespan
Multi-Agent Based Framework For Dynamic Scheduling System
Heuristics for permutation flow shops to minimize total flowtime
Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization
Hybrid Heuristic for Total Flowtime Minimization in No-wait Flow Shops
Composite Heuristic Algorithm for Permutation Flowshop Scheduling Problems with Total Flowtime Minim
Web Service based parallel method for large scale flow shop scheduling problems
An Efficient Method for No-Wait Flow Shop Scheduling to Minimize Makespan
Iterative Local Search Algorithm for No-Wait Flowshop Scheduling Problems to Minimize Makespan
Cost optimization method for workflows with deadline constraints in Grids
Time-Cost Tradeoff Dynamic Scheduling Algorithm for Workflows in Grids
A hybrid QOS-based algorithm for independent tasks scheduling in Grid
Objective Increment based Hybrid GA for No-wait Flowshops
Hybrid Genetic-VNS Algorithm with Total Flowtime Minimization for the No-wait Flowshop Problem
An evolutionary algorithm for constraint flow shops with multi-criteria optimization