Maximizing total job value on a single machine with job selection

Joonyup Eun; Chang Sup Sung; Eun Seok Kim

doi:10.1057/s41274-017-0238-z

Maximizing total job value on a single machine with job selection

Joonyup Eun, Chang Sup Sung, Eun Seok Kim

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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.

Original language	English
Pages (from-to)	998-1005
Number of pages	8
Journal	Journal of the Operational Research Society
Volume	68
Issue number	9
DOIs	https://doi.org/10.1057/s41274-017-0238-z
Publication status	Published - 2017 Sep 1
Externally published	Yes

Keywords

branch-And-bound
heuristic
job value
scheduling
stepwise value function

ASJC Scopus subject areas

Management Information Systems
Strategy and Management
Management Science and Operations Research
Marketing

Access to Document

10.1057/s41274-017-0238-z

Fingerprint Dive into the research topics of 'Maximizing total job value on a single machine with job selection'. Together they form a unique fingerprint.

Cite this

@article{977a11b8c1a043b4ac3b39dd72b02d28,

title = "Maximizing total job value on a single machine with job selection",

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 = "branch-And-bound, heuristic, job value, scheduling, stepwise value function",

author = "Joonyup Eun and Sung, {Chang Sup} and Kim, {Eun Seok}",

year = "2017",

month = sep,

day = "1",

doi = "10.1057/s41274-017-0238-z",

language = "English",

volume = "68",

pages = "998--1005",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Palgrave Macmillan Ltd.",

number = "9",

}

TY - JOUR

T1 - Maximizing total job value on a single machine with job selection

AU - Eun, Joonyup

AU - Sung, Chang Sup

AU - Kim, Eun Seok

PY - 2017/9/1

Y1 - 2017/9/1

N2 - 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.

AB - 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.

KW - branch-And-bound

KW - heuristic

KW - job value

KW - scheduling

KW - stepwise value function

UR - http://www.scopus.com/inward/record.url?scp=85021101759&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021101759&partnerID=8YFLogxK

U2 - 10.1057/s41274-017-0238-z

DO - 10.1057/s41274-017-0238-z

M3 - Article

AN - SCOPUS:85021101759

VL - 68

SP - 998

EP - 1005

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

IS - 9

ER -

Maximizing total job value on a single machine with job selection

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this