English

运筹学学报 >

2016 , Vol. 20 >Issue 3: 33 - 44

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2016.03.004

运筹学

具有时间与位置相关及维修限制的单机排序问题

展开
  • 1. 重庆师范大学数学科学学院, 重庆 400047

收稿日期: 2016-01-11

  网络出版日期: 2016-09-15

基金资助

国家自然科学基金(Nos. 11401065, 11571321), 重庆市教委基金(No. KJ130606), 重庆市自然科学基金(No.cstc2014jcyjA00003)

收起

Combining time and position dependent effects on  a single machine subject to maintenance activities

Expand
  • 1. College of Mathematics Sience, Chongqing Normal University, Chongqing 400047, China

Received date: 2016-01-11

  Online published: 2016-09-15

Fold

摘要

考虑时间和位置相关的单机排序问题, 且机器具有退化的维修限制. 工件的实际加工时间是工件加工位置相关的函数, 目标函数为最大完工时间和总完工时间两个函数, 并利用匹配算法给出这两个问题的多项式时间算法. 最后得出工件满足一定条件时最大完工时间满足组平衡规则.

关键词： 排序; 时间与位置相关; 维修活动; 匹配算法; 组平衡规则

本文引用格式

苟燕, 张新功 . 具有时间与位置相关及维修限制的单机排序问题[J]. 运筹学学报, 2016 , 20(3) : 33 -44 . DOI: 10.15960/j.cnki.issn.1007-6093.2016.03.004

Abstract

In this paper, we consider combining time and position dependent effects on a single machine subject to deteriorating maintenance activities.  The actual processing time of the job is a function of its position.  We focus on minimizing two classical objectives: the makespan and the sum of the completion times. The proposed two problems can be solved in polynomial time by using the matching algorithm. Finally, the makespan problems can be solved by the group balance principle under some certain conditions.

Key words： scheduling; time-dependent and position-dependent; maintenance activities; matching algorithm; the group balance principle

Options
文章导航

/

〈 〉