机器具有优势关系下的工件加工时间可控的流水作业排序问题

摘要

本文主要研究机器具有优势关系下的工件加工时间可控的流水作业排序问题.我们主要对以下两种情形进行了讨论:工件加工时间为线性恶化和线性学习.对于每一种加工模型,我们分别研究了几类不同的优势机器,并且对每种情况均给出了多项式时间算法.%In this paper, we study permutation flow shop scheduling problems with time-dependent processing times on dominated machines. Two processing models: linear deteriorating jobs and linear learning jobs are considered. For these processing models, we consider some cases of dominated machines constraint, and present a polynomial-time solution algorithm for each case.