单机排序问题|r_j,prmp| ∑w_j(1-e^(-ac_j)) 的动态在线调度

On-line Single-Machine Dynamic Scheduling for 1|r_j,prmp| ∑w_j(1-e^(-ac_j))

本文首先一般化了可中断的概念,并建立了相应的中断—安装重复模型,然后研究了单机排序问题1|rj,prmp| wj(1-e-acj)在中断—重复和中断—安装重复模型下的动态在线排序问题,给出了只考虑当前可用信息而不是考虑全部任务信息的在线调度规则。

We first generalize the concept of preemptive and develop the corresponding preempt-setup-repeat model. And then we use preempt-resume and preempt-setup-repeat models to study the dynamic single-machine scheduling problem of 1|r_j,prmp|w_j(1-e~~^(-ac_j)) and develop on-line optimal dispatching rules, which consider only available information.