Parallel machine scheduling problems with a single server
| Author(s) : | Svetlana A. Kravchenko Frank Werner, |
| Publisher : | N/A |
| Publication Date : | 1997 |
| ISSN : | N/A |
| Abstract : | In this paper, we give a polynomial algorithm for problem P | rj, pj = p | ? fj(Cj), where fj is any non-decreasing function such that for any indices i and j, function fi ? fj is monotonous, and a polynomial algorithm for problem P | rj, pj = p, Dj | max j(Cj), where j is any non-decreasing function for any j., |