Search
Now showing items 1-2 of 2
Approximation algorithms for single machine scheduling with one unavailability period
(Springer Nature, 2009-03)
In this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomial-time approximation scheme when ...
Heuristics for the variable sized bin-packing problem
(Elsevier, 2009-10)
We investigate the one-dimensional variable-sized bin-packing problem. This problem requires packing a set of items into a minimum-cost set of bins of unequal sizes and costs. Six optimization-based heuristics for this ...
Share this page