位置：成果数据库 > 期刊 > 期刊详情页
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
  • ISSN号：0020-0190
  • 期刊名称：Information Processing Letters
  • 时间：0
  • 页码：292-297
  • 相关项目：两阶段物流排序和工件可拒绝排序理论研究
作者： Li, Wenhua1|Zhang, Zhenkun2|Yang, Sufang1|
同期刊论文项目
两阶段物流排序和工件可拒绝排序理论研究
期刊论文 30
同项目期刊论文
On-line integrated production and outbound distribution scheduling to minimize the maximum delivery
Optimal algorithms for single-machine scheduling with rejection to minimize the makespan
最小化时间表长的带有多个工件组单机无界继列批在线排序
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
Scheduling proportionally deteriorating jobs in two-machine open shop with a non-bottleneck machine
Single-machine scheduling under the job rejection constraint
Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
The unbounded parallel-batch scheduling with rejection
SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS
（2＋1）维MKdV方程的Darboux变换及其孤子解
利用一般tanh函数法和（G＇/G）函数扩展法求非线性波动方程的行波解及其一致性分析
（2＋1）维耦合KdV方程达布变换间的关系及其孤子解
最小化时间表长和最大加工运输时间的单机继列批在线排序
Broer-Kaup系统3类达布变换间的关系及其精确解