Now showing items 1-4 of 4
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 ...
Optimal solution of the discrete cost multicommodity network design problem
We investigate a multicommodity network design problem where a discrete set of Technologies with step-increasing cost and capacity functions should be installed on the edges. This problem is a fundamental network design ...
Heuristics for the variable sized bin-packing problem
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 ...
Energetic reasoning revisited: application to parallel machine scheduling
(Springer Science+Business Media, 2008-08)
We consider the problem of minimizing makespan on identical parallel machines subject to release dates and delivery times. We present several new feasibility tests and adjustment techniques that consistently improve ...
Share this page