Application of the Net Present Value Criterion in Random and Flow Shop Scheduling*
研究将净现值作为衡量车间盈利性的标准，通过仿真比较了基于时间和价值的调度规则，发现利用货币信息的规则在多数情况下能获得更高净现值且不显著增加延误。
ABSTRACT While the majority of the literature on shop scheduling has emphasized time‐based performance criteria such as mean flow time, lateness, and tardiness, the primary goal of management should be the maximization of shop profitability. In this research the net present value (NPV) criterion is introduced to measure shop profitability. This measure combines aspects of job flow time and inventory holding costs into a single measure. A simulation model of a job shop is used to examine the performance of a variety of time‐ and value‐based scheduling rules. These rules are evaluated with respect to the NPV criterion in both random and flow shop environments. The results suggest that priority rules that utilize monetary information about jobs yield a higher NPV than many time‐based rules in most situations, with little sacrifice in job tardiness. A well‐researched time‐based rule, critical ratio, also provides excellent performance when the shop is heavily loaded.