Maximizing total job value on a single machine with job selection
研究在机器可用性约束下，通过选择作业并考虑其价值随时间阶梯式下降，最大化总作业价值的单机调度问题，提出了分支定界和启发式算法，后者能在短时间内给出有效解。
This paper describes a single machine scheduling problem of maximizing total job value with a machine availability constraint. The value of each job decreases over time in a stepwise fashion. Several solution properties of the problem are developed. Based on the properties, a branch-and-bound algorithm and a heuristic algorithm are derived. These algorithms are evaluated in the computational study and the results show that the heuristic algorithm provides effective solutions within short computation times.