Minimizing total completion time on a single machine with step improving jobs

Kim, Eun-Seok and Oron, Daniel (2015) Minimizing total completion time on a single machine with step improving jobs. Journal of the Operational Research Society, 66 (9) . pp. 1481-1490. ISSN 0160-5682 [Article] (doi:10.1057/jors.2014.91)

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

Download (227kB) | Preview

Abstract

Production systems often experience a shock or a technological change, resulting in performance improvement. In such settings, job processing times become shorter if jobs start processing at, or after, a common critical date. This paper considers a single machine scheduling problem with step-improving processing times, where the effects are job-dependent. The objective is to minimize the total completion time.

We show that the problem is NP-hard in general and discuss several special cases which can be solved in polynomial time. We formulate a Mixed Integer Programming (MIP) model and develop an LP-based heuristic for the general problem. Finally, computational experiments show that the proposed heuristic yields very effective and efficient solutions.

Item Type: Article
Additional Information: Published online 10 December 2014
Research Areas: A. > Business School > International Management and Innovation
Item ID: 17406
Useful Links:
Depositing User: Eun-Seok Kim
Date Deposited: 25 Aug 2015 09:44
Last Modified: 09 Jun 2021 18:44
URI: https://eprints.mdx.ac.uk/id/eprint/17406

Actions (login required)

View Item View Item

Statistics

Downloads
Activity Overview
150Downloads
316Hits

Additional statistics are available via IRStats2.