位置：成果数据库 > 期刊 > 期刊详情页
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
  • ISSN号：1094-6136
  • 期刊名称：Journal of Scheduling
  • 时间：2012
  • 页码：77-81
  • 相关项目：在线排序问题的算法设计与竞争比分析
作者： Peihai Liu|Xiwen Lu|Yang Fang|
同期刊论文项目
在线排序问题的算法设计与竞争比分析
期刊论文 14
同项目期刊论文
Approximation schemes for two-agent scheduling on parallel machines
Two-machine flow shop scheduling with individual operation's rejection
Asymptotical optimality ofWSEPT for stochastic online scheduling on uniform machines
Online batch scheduling on parallel machines with delivery times
平行机上单位加工时间加权总完工时间排序问题的反问题
在线可中断二台机器流水作业问题
有使用限制的二台机器流水作业问题
On-line and semi-online scheduling for flow shop problems on two machines
The inverse parallel machine scheduling problem with minimum total completion time
Vehicle routing problems with regular objective functions on a path
The expected asymptotical ratio for preemptive stochastic online problem
Online algorithms for batch machines scheduling with delivery times
Online scheduling on two parallel machines with release times and delivery times