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.
- job value
- stepwise value function
ASJC Scopus subject areas
- Modelling and Simulation
- Strategy and Management
- Statistics, Probability and Uncertainty
- Management Science and Operations Research