Photo from academic.microsoft.com
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… Click to show full abstract
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.
Keywords:
machine;
total job;
maximizing total;
value;
job;
single machine
Journal Title: Journal of the Operational Research Society
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of the Operational Research Society
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!