## Abstract

In scheduling with controllable processing times the actual processing time of each job is to be chosen from the interval between the smallest (compressed or fully crashed) value and the largest (decompressed or uncrashed) value. In the problems under consideration, the jobs are processed on a single machine and the quality of a schedule is measured by two functions: the maximum cost (that depends on job completion times) and the total compression cost. Our main model is bicriteria and is related to determining an optimal trade-off between these two objectives. Additionally, we consider a pair of associated single criterion problems, in which one of the objective functions is bounded while the other one is to be minimized. We reduce the bicriteria problem to a series of parametric linear programs defined over the intersection of a submodular polyhedron with a box. We demonstrate that the feasible region is represented by a so-called base polyhedron and the corresponding problem can be solved by the greedy algorithm that runs two orders of magnitude faster than known previously. For each of the associated single criterion problems, we develop algorithms that deliver the optimum faster than it can be deduced from a solution to the bicriteria problem.

Original language | English |
---|---|

Pages (from-to) | 247-269 |

Number of pages | 23 |

Journal | International Journal of Foundations of Computer Science |

Volume | 20 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2009 Apr |

## Keywords

- Base polyhedron
- Controllable processing times
- Polymatroid
- Single machine scheduling

## ASJC Scopus subject areas

- Computer Science (miscellaneous)