Maximizing total job value on a single machine with job selection

Eun, Joonyup, 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 [Article] (doi:10.1057/s41274-017-0238-z)

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

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: 29 Nov 2022 20:40
URI: https://eprints.mdx.ac.uk/id/eprint/21666

Actions (login required)

View Item View Item

Statistics

Activity Overview
6 month trend
178Downloads
6 month trend
316Hits

Additional statistics are available via IRStats2.