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

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

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: 06 Sep 2018 01:40
URI: http://eprints.mdx.ac.uk/id/eprint/17406

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