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.
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.
Available Versions of this Item
Repository Staff Only: item control page