Maximizing total job value on a single machine with job selection

Eun, Joonyup and Sung, Chang-Sup and Kim, Eun-Seok (2017) Maximizing total job value on a single machine with job selection. Journal of the Operational Research Society, 68 (9). pp. 998-1005. ISSN 0160-5682

[img]
Preview
PDF - Published version (with publisher's formatting)
Available under License Creative Commons Attribution.

Download (303kB) | Preview
[img] PDF - Final accepted version (with author's formatting)
Restricted to Repository staff and depositor only

Download (674kB)

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.

Item Type: Article
Research Areas: A. > Business School
Item ID: 21666
Depositing User: Eun-Seok Kim
Date Deposited: 21 Apr 2017 15:00
Last Modified: 08 Dec 2018 07:12
URI: http://eprints.mdx.ac.uk/id/eprint/21666

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year