Maximizing total job value on a single machine with job selection

Joonyup Eun (), Chang Sup Sung () and Eun-Seok Kim ()
Additional contact information
Joonyup Eun: Vanderbilt University Medical Center
Chang Sup Sung: Korea Advanced Institute of Science and Technology (KAIST)
Eun-Seok Kim: Middlesex University

Journal of the Operational Research Society, 2017, vol. 68, issue 9, 998-1005

Abstract: 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: scheduling; job value; stepwise value function; branch-and-bound; heuristic (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/s41274-017-0238-z Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:68:y:2017:i:9:d:10.1057_s41274-017-0238-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/s41274-017-0238-z

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().