|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 4 van 24 gevonden artikelen
| Titel: |
Capacitated single machine scheduling and its on-line heuristics |
| Auteur: |
Xing, Wenxun Lam, Kokin |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 34 (2002) nr. 11 pagina's 991-998 |
| Jaar: |
2002-11-01 |
| Inhoud: |
The capacitated single machine scheduling problem arises from a manufacturing system. The machine works periodically and is capacitated in each period. This is a variant of the bin packing problem. We theoretically compare two types of production settings: in the first type, the machine processes each demand without splitting and in the second, splitting is allowed but a setup time occurs. From the worst case viewpoint, we show that the optimal schedule length of the production without splitting may be nearly twice as long as that of the production with splitting. The ratio of two is asymptotically tight. Then we adapt the well-known bin packing heuristics for the on-line version of the capacitated single machine scheduling problem and give their worst case analysis. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 4 van 24 gevonden artikelen
| << vorige | volgende >> |