## Scheduling chains with identical jobs and constant delays on a single machine

Autor(en): | Brucker, P Knust, S Oguz, C |

Stichwörter: | complexity results; delays; Mathematics; Mathematics, Applied; Operations Research & Management Science; scheduling; TIME-LAGS |

Erscheinungsdatum: | 2006 |

Herausgeber: | SPRINGER HEIDELBERG |

Journal: | MATHEMATICAL METHODS OF OPERATIONS RESEARCH |

Volumen: | 63 |

Ausgabe: | 1 |

Startseite: | 63 |

Seitenende: | 75 |

Zusammenfassung: | n this paper we study the single-machine problem 1 vertical bar chains(1), p(j) = p vertical bar Sigma C-j in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between consecutive jobs in a chain are satisfied and the sum of all completion times of the jobs is minimized. We show that this problem is polynomially solvable. |

ISSN: | 14322994 |

DOI: | 10.1007/s00186-005-0014-8 |

Show full item record