Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan
Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan
复制标题
DOI：
10.1007/s00170-009-2314-2
复制
发表时间：
2010-05
期刊：
影响因子：
--
通讯作者：
Ji-Bo Wang
中科院分区：
文献类型：
--
作者：
Ji-Bo Wang
本文研究了带有恶化工件的无工件、多台机器流水车间调度问题。所谓恶化作业，我们指的是其处理时间是其执行开始时间的增函数的作业。假设一个简单的线性退化函数。当m-1台机器之间的某些优势关系可以满足时，我们证明了最大完工时间最小化问题可以在多项式时间内求解。
In this paper, we consider ann-job,m-machine flow shop scheduling problem with deteriorating jobs. By deteriorating jobs, we mean jobs whose processing times are an increasing function of their execution starting time. A simple linear deterioration function is assumed. When some dominant relationships betweenm− 1 machines can be satisfied, we show that the makespan minimization problem can be solved in polynomial time.