No-wait resource allocation flowshop scheduling with learning effect under limited cost availability
No-wait resource allocation flowshop scheduling with learning effect under limited cost availability
复制标题
DOI：
10.1093/comjnl/bxy034
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Yu Ti;Ming Xu;Chong Jiang;Ji-Bo Wang;Xiao-Yuan Wang
中科院分区：
文献类型：
--
作者：
Yu Ti;Ming Xu;Chong Jiang;Ji-Bo Wang;Xiao-Yuan Wang
研究了两台机器上具有学习效应和资源分配的无等待流水车间调度问题。我们的目标是找到最优的资源分配和作业序列，使最小化的调度标准（总加权资源消耗）的约束下，总加权资源消耗（调度标准）是小于或等于一个给定的常数，其中的调度标准包括加权完工时间，总完成（等待）时间和总的绝对差异完成（等待）时间。我们证明了这两个问题分别是多项式可解的。
This article considers the no-wait flowshop scheduling with learning effect and resource allocation on two-machine. Our goal is to find the optimal resource allocations and job sequence that minimize the scheduling criterion (the total weighted resource consumption) subject to the constraint that the total weighted resource consumption (the scheduling criterion) is less than or equal to a given constant, where the schedule criteria include weighted makespan, total completion (waiting) time and total absolute differences in completion (waiting) times. We show that these two problems are polynomially solvable respectively.