位置：成果数据库 > 期刊 > 期刊详情页
最小化时间表长和最大加工运输时间的单机继列批在线排序
  • ISSN号：1671-6841
  • 期刊名称：《郑州大学学报：理学版》
  • 时间：0
  • 分类：O223[理学—运筹学与控制论;理学—数学]
  • 作者机构：[1]郑州大学数学系,河南郑州450001
  • 相关基金：基金项目：国家自然科学基金资助项目,编号10971201;国家青年科学基金资助项目,编号10901142;河南省基础与前沿技术研究计划资助项目,编号082300410070.
作者： 赵永刚[1], 李文华[1], 豆俊梅[1]
关键词： 单机, 在线算法, 继列批, 运输时间, 竞争比, single machine, on-line algorithm, serial-batching, delivery time, competitive ratio
中文摘要：

研究了目标函数为时间表长和最大加工运输时间的单机继列批在线排序问题．对于时间表长问题，给出了当批容量无界时竞争比是（√5＋1）/2的最好可能的在线算法和当批容量有限时竞争比不超过2的在线算法；对于最大加工运输时间问题，证明了当批容量无界时的竞争比不超过2．

英文摘要：

On-line scheduling on a single serial batch machine is considered to minimize makespan and maximum delivery time. For the makespan problem, on-line algorithms are provided with the best competitive ratio （√5＋1）/2 where the capacity b is sufficiently large and with competitive ratio 2 where b is finite. For the m ilximum delivery where b is infinite.

同期刊论文项目
平行机分组工件排序的多面体方法
期刊论文 34
两阶段物流排序和工件可拒绝排序理论研究
期刊论文 30
同项目期刊论文
一个具有退化的两个代理的排序问题
两个代理的单机排序问题的多项式时间算法
具有维修时间的两台平行机在线排序
工业生产中一个带有拒绝费用的工件排序问题研究
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
单可变资源最小化加权完工时间和排序问题的强NP-困难性(英文)
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespa
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
Best semi-online algorithms for unbounded parallel batch scheduling
Online scheduling on batching machines to minimise the total weighted completion time of jobs with p
SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE P
Parallel-machine scheduling with deteriorating jobs and rejection
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
Unbounded parallel-batching scheduling with two competitive agents
Group scheduling and due date assignment on a single machine
Preemptive scheduling with simple linear deterioration on a single machine
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delive
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precede
两个代理的单机排序问题研究
一种基于多维度信任的WSN安全数据融合方法
赋予图均衡方向的欧拉图构造法和圈树分解法
工件带链约束和尺寸的并行批排序
单可变资源最小化加权完工时间和排序问题的强NP-困难性
两个带有分批费用的单机平行分批排序问题
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
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS
（2＋1）维MKdV方程的Darboux变换及其孤子解
利用一般tanh函数法和（G＇/G）函数扩展法求非线性波动方程的行波解及其一致性分析
（2＋1）维耦合KdV方程达布变换间的关系及其孤子解
Broer-Kaup系统3类达布变换间的关系及其精确解
期刊信息
  • 《郑州大学学报：理学版》
  • 中国科技核心期刊
  • 主管单位:河南省教育厅
  • 主办单位:郑州大学
  • 主编：李燕燕
  • 地址：郑州市高新区科学大道100号
  • 邮编：450001
  • 邮箱：lixueban@zzu.edu.cn
  • 电话：0371-67781272
  • 国际标准刊号：ISSN：1671-6841
  • 国内统一刊号：ISSN：41-1338/N
  • 邮发代号:36-191
  • 获奖情况:
  • 国内外数据库收录:
  • 美国化学文摘（网络版）,美国数学评论（网络版）,波兰哥白尼索引,德国数学文摘,中国中国科技核心期刊,中国北大核心期刊（2008版）,中国北大核心期刊（2011版）,中国北大核心期刊（2014版）,英国英国皇家化学学会文摘
  • 被引量:2791