【摘 要】
：
In this paper, we study a flow shop problem called F2→D丨v=1, c ≥1[Cmax In the problem, there are n jobs needed to be processed on machine A first, then o
【机 构】
：
Software School,Dalian University of Technology,Dalian 116620,China
【出 处】
：
2015全国理论计算机科学学术年会
论文部分内容阅读
In this paper, we study a flow shop problem called F2→D丨v=1, c ≥1[Cmax In the problem, there are n jobs needed to be processed on machine A first, then on machine B, after machine B finishes the job, the job will be carried to the destination by the transporter V.The transporter V is initially located on machine B.The transporter V can carry at most c jobs to destination every time where c ≥ 1.It costs some time transporting jobs to destination and going back to machine B for transporter V.The objective is to minimize the completion time when all the jobs are carried to the destination.In this paper, we study the special case F2 → D丨v=1, B(i)=p, c ≥ 1丨Cmax where each job has identical processing time on machine B, and give an optimal algorithm.
其他文献
A regular (3, 4)-CNF formula F is a 3-CNF formula, where each variable occurs exactly four times in F.A regular (3, 4, u)-CNF formula F is a regular (3, 4)-
In this paper, we consider the problem of scheduling jobs with release dates and rejection on a bounded single parallel batching machine.Our objective is to
As an important class of approximate dynamic programming, the direct heuristic dynamic programming (DHDP) is discussed in this paper.DHDP performs well due
【本刊讯】2017年1月17日,中国黄金集团公司2017年工作会议暨第一届职工代表大会第二次会议在北京召开。国有企业监事会主席董树奎出席会议,集团公司总经理、党委书记宋鑫出
Conditional probability neural network (CPNN) has special advantage in pattern classification problems.However, how to find the optimal parameters of the CP
巧妙开发设计课前三分钟,将课前三分钟作为学生展示英语“学习成果”的时间,开展各种形式的英语活动,活跃了课堂气氛,提高了课堂效率,这就犹如一首美妙的课堂教学的乐曲奏响
In this paper, we studied the problem of link prediction in directed signed social networks.The relationships of these networks can be either positive (frie
在实施少儿美术教育的过程中,首先要找到适合少儿美术教育的教学方法,才能引导与培养少儿对学习美术这门学科的兴趣.通过与少儿感兴趣的玩具及简单的美术构图的结合,让少儿慢
We consider a regular random (k, s)-SAT problem.We show that for all k exceeding an absolute constant k0, with the clause density αureq > 2klog2-klog2/2 +
请下载后查看，本文暂不支持在线获取查看简介。
Please download to view, this article does not support online access to view profile.