Maximizing total job value on a single machine with job selection

Article


Eun, J., Sung, C. and Kim, E. 2017. Maximizing total job value on a single machine with job selection. Journal of the Operational Research Society. 68 (9), pp. 998-1005. https://doi.org/10.1057/s41274-017-0238-z
TypeArticle
TitleMaximizing total job value on a single machine with job selection
AuthorsEun, J., Sung, C. and Kim, E.
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.

LanguageEnglish
PublisherPalgrave Macmillan
JournalJournal of the Operational Research Society
ISSN0160-5682
Publication dates
Print01 Sep 2017
Publication process dates
Deposited21 Apr 2017
Accepted18 Apr 2017
Output statusPublished
Publisher's version
License
Digital Object Identifier (DOI)https://doi.org/10.1057/s41274-017-0238-z
Permalink -

https://repository.mdx.ac.uk/item/86y70

Download files


Publisher's version

Restricted files

Accepted author manuscript

  • 19
    total views
  • 0
    total downloads
  • 4
    views this month
  • 0
    downloads this month

Export as