Scheduling with step-improving processing times

Kim, Eun-Seok and Oron, Daniel (2013) Scheduling with step-improving processing times. In: INFORMS Annual Meeting 2014, 9-12 November 2014, San Francisco, CA, U.S.A.

Full text is not in this repository.

Abstract

We study a single machine scheduling problem of minimizing total completion time with step-improving processing times. For step-improving processing times, job processing times reduce by a job-dependent amount after a common critical date.

We show that the problem is NP-hard in general. We formulate a Mixed Integer Programming model and develop an LP-based heuristic for the problem. Finally, we perform computational experiments showing that the proposed heuristic provides effective solutions.

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > Business School > International Management and Innovation
Item ID: 16000
Depositing User: Eun-Seok Kim
Date Deposited: 14 May 2015 10:43
Last Modified: 12 Sep 2017 14:01
URI: https://eprints.mdx.ac.uk/id/eprint/16000

Actions (login required)

Edit Item Edit Item