Worst-case analysis for new online bin packing problems

Tipo di pubblicazione: Altro
Tipologia MIUR: Altro > Altro
Titolo: Worst-case analysis for new online bin packing problems
Autori: Baldi M.M., Crainic T.G., Perboli G., Tadei R.
Autori di ateneo:
Editore: CIRRELT-2013-11
Abstract: We consider two new online bin packing problems, the online Variable Cost and Size Bin Packing Problem (o-VCSBPP) and the online Generalized Bin Packing Problem (o-GBPP). We take two well-known bin packing algorithms to address them, the First Fit (FF) and the Best Fit (BF). We show that both algorithms have an asymptotic worst-case ratio bound equal to 2 for the o-VCSBPP and this bound is tight. When there are enough bins of a particular type to load all items, FF and BF also have an absolute worst-case ratio bound equal to 2 for the o-VCSBPP, and this bound is also tight. In addition, we prove that no worst-case ratio bound of FF and BF can be computed for the o-GBPP. Therefore, we consider a natural evolution of these algorithms, the First Fit with Rejection and the Best Fit with Rejection, able to reject inconvenient bins at the end of the process. Similarly, we prove that no worst-case ratio of these algorithms can be computed for the o-GBPP. Finally, we give sucient conditions under which algorithms do not admit any performance ratio, and conclude that the worst-case results obtained for the o-VCSBPP and the o-GBPP also hold for the oine variant of these two problems
Data: 2013
Status: Pubblicato
Lingua della pubblicazione:
Parole chiave: online bin packing problems, asymptotic worst-case ratio
Dipartimenti (originale): DAUIN - Dipartimento di Automatica Informatica
Dipartimenti: DAUIN - Dipartimento di Automatica e Informatica
URL correlate:
    Area disciplinare: Area 01 - Scienze matematiche e informatiche > RICERCA OPERATIVA
    Data di deposito: 20 Feb 2013 19:33
    Data ultima modifica (IRIS): 20 Gen 2014 11:06:03
    Data inserimento (PORTO): 07 Nov 2014 10:27
    Permalink: http://porto.polito.it/id/eprint/2506173

    Allegati

    [img]
    Preview
    PDF (Worst_case_analysis_for_new_online_bin_packing_problems) - Postprint
    Accesso al documento: Visibile (Ad accesso aperto)
    Licenza: Pubblico - Tutti i diritti riservati.

    Download (388Kb (397664 bytes)) | Preview

    Azioni (richiesto il login)

    Visualizza il documento (riservato amministratori) Visualizza il documento (riservato amministratori)

    Statistiche sul Download degli allegati

    Altre statistiche su questa pubblicazione...