Makespan Minimization on Three-Machine Flow shop with deteriorating jobs
Makespan Minimization on Three-Machine Flow shop with deteriorating jobs
复制标题
DOI：
10.1142/s021759591350022x
复制
发表时间：
2013-12
期刊：
影响因子：
--
通讯作者：
Ji-Bo Wang;Ming-Zheng Wang
中科院分区：
文献类型：
--
作者：
Ji-Bo Wang;Ming-Zheng Wang
在这项研究中，我们考虑了一个带有恶化作业的三台机器上的置换流水作业调度问题(一个恶化的作业意味着作业的加工时间是其开始时间的递增函数)，以最小化最大完工时间。我们将工作恶化建模为与时间的线性函数成正比的函数。对于某些特殊情况，我们证明了该问题可以在多项式时间内求解。我们为一般情况开发了分枝定界法和启发式程序。给出了分枝定界法和启发式算法的计算实验。
In this study, we consider a permutation flow shop scheduling problem on a three-machine with deteriorating jobs (a deteriorating job means that the job's processing time is an increasing function of its starting time) so as to minimize the makespan. We model job deterioration as a function that is proportional to a linear function of time. For some special cases, we prove that the problem can be solved in polynomial time. We develop branch-and-bound and heuristic procedures for the general case. Computational experiments for the branch-and-bound algorithm and heuristic algorithm are presented.