A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Scheduling with Discretely Compressible Processing Times to Minimize Makespan
2014
Applied Mechanics and Materials
In this paper, we address the scheduling model with discretely compressible processing times, where processing any job with a compressed processing time incurs a corresponding compression cost. We consider the following problem: scheduling with discretely compressible processing times to minimize makespan with the constraint of total compression cost on identical parallel machines. Jobs may have simultaneous release times. We design a pseudo-polynomial time algorithm by approach of dynamic programming and an FPTAS.
doi:10.4028/www.scientific.net/amm.575.926
fatcat:6yka7jn44fdnvaonhj64ru3esi