位置：成果数据库 > 期刊 > 期刊详情页
Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
  • ISSN号：0925-5273
  • 期刊名称：International Journal of Production Economics
  • 时间：2014.10
  • 页码：31-38
  • 相关项目：基于调度管理与客户利益之间平衡的排序问题
作者： Ran Ma|Long Wan|Lijun Wei|Jinjiang Yuan|
同期刊论文项目
基于调度管理与客户利益之间平衡的排序问题
期刊论文 49
同项目期刊论文
工件按加工长度不增序到达的最小化最大流程在线分批排序
Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum
On the vertex-arboricity of -minor-free graphs of diameter 2
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disru
Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited
Online scheduling on a single machine with rejection under an agreeable condition to minimize the to
Primary–secondary bicriteria scheduling on identical machines to minimize the total completion time
A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machi
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum deliv
LPT online strategy for parallel-machine scheduling with kind release times
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
带有分批费用的容量有界的单机平行分批排序问题
Online scheduling of incompatible unit-length job families with lookahead
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families
Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited r
Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
A note on the preemptive scheduling to minimize total completion time with release time and deadline
A note on reverse scheduling with maximum lateness objective
A note on Pareto minimizing total completion time and maximum cost
Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
两个带有分批费用的平行分批排序问题的算法
最小化总完工时间与分批费用之和的有界分批排序问题
具有前瞻区间的两个工件组单机在线排序问题
具有相同批容量和相同工期的单机准时分批排序问题
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum latene
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maxi
An on-line scheduling problem of parallel machines with common maintenance time
具有多重公共工期的单机退化工件排序