Single-machine scheduling with stepwise tardiness costs and release times

Şahin, Güvenç and Ahuja, Ravindra K. (2011) Single-machine scheduling with stepwise tardiness costs and release times. Journal of Industrial and Management Optimization, 7 (4). pp. 825-848. ISSN 1547-5816 (Print) 1553-166X (Online)

This is the latest version of this item.

PDF (This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.3934/jimo.2011.7.825


We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity results that characterize some cases of the problem as pseudo-polynomially solvable. For the difficult-to-solve cases of the problem, we develop mathematical programming formulations, and propose heuristic algorithms. We test the formulations and heuristic algorithms on randomly generated single-machine scheduling problems and real-life datasets for the hump sequencing problem. Our experiments show promising results for both sets of problems.

Item Type:Article
Uncontrolled Keywords:Single-machine scheduling; stepwise tardiness; hump sequencing; railyards; yard operations
Subjects:T Technology > TF Railroad engineering and operation > TF501-668 Railway operation and management
T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
ID Code:17312
Deposited By:Güvenç Şahin
Deposited On:27 Oct 2011 14:04
Last Modified:22 May 2019 12:42

Available Versions of this Item

Repository Staff Only: item control page