The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Digital Archiving Policy
  • Promote your Publication
  • Metadata Harvesting (OAI2)

IJACSA

  • About the Journal
  • Call for Papers
  • Editorial Board
  • Author Guidelines
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Fees/ APC
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving

Special Issues

  • Home
  • Archives
  • Proposals
  • Guest Editors
  • SUSAI-EE 2025
  • ICONS-BA 2025
  • IoT-BLOCK 2025

Future of Information and Communication Conference (FICC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Computing Conference

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Call for Papers
  • Editorial Board
  • Guidelines
  • Submit
  • Current Issue
  • Archives
  • Indexing
  • Fees
  • Reviewers
  • Subscribe

DOI: 10.14569/IJACSA.2016.071252
PDF

Modeling and Solving the Open-End Bin Packing Problem

Author 1: Maiza Mohamed
Author 2: Tebbal Mohamed
Author 3: Rabia Billal

International Journal of Advanced Computer Science and Applications(IJACSA), Volume 7 Issue 12, 2016.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

Abstract: In the Open-End Bin Packing Problem a set of items with varying weights must be packed into bins of uniform weight limit such that the capacity of the bin can be exceeded only by the last packed item, known as the overflow item. The objective is to minimize the number of used bins. In this paper, we present our Integer Linear Program model based on a modification of Cesili and Righini model [1]. Also, we propose two greedy heuristics to solve a problem. The first one is an adaptation of the Minimum Bin Slack heuristic where we have reduced to one unit capacity, the weight of the largest item in the current bin. While, the second heuristic is based on the well-known First Fit Decreasing heuristic. Computational results based on benchmark instances taken from the literature as well as generated instances show the effectiveness of the proposed heuristics in both solution quality and time requirement.

Keywords: Open-End Bin-packing; heuristics; discrete opti-mization; combinatorial problem

Maiza Mohamed, Tebbal Mohamed and Rabia Billal, “Modeling and Solving the Open-End Bin Packing Problem” International Journal of Advanced Computer Science and Applications(IJACSA), 7(12), 2016. http://dx.doi.org/10.14569/IJACSA.2016.071252

@article{Mohamed2016,
title = {Modeling and Solving the Open-End Bin Packing Problem},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2016.071252},
url = {http://dx.doi.org/10.14569/IJACSA.2016.071252},
year = {2016},
publisher = {The Science and Information Organization},
volume = {7},
number = {12},
author = {Maiza Mohamed and Tebbal Mohamed and Rabia Billal}
}



Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

IJACSA

Upcoming Conferences

IntelliSys 2025

28-29 August 2025

  • Amsterdam, The Netherlands

Future Technologies Conference 2025

6-7 November 2025

  • Munich, Germany

Healthcare Conference 2026

21-22 May 2026

  • Amsterdam, The Netherlands

Computing Conference 2026

9-10 July 2026

  • London, United Kingdom

IntelliSys 2026

3-4 September 2026

  • Amsterdam, The Netherlands

Computer Vision Conference 2026

15-16 October 2026

  • Berlin, Germany
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Paper
  • Indexing

Our Conferences

  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference
  • Communication Conference

Help & Support

  • Contact Us
  • About Us
  • Terms and Conditions
  • Privacy Policy

© The Science and Information (SAI) Organization Limited. All rights reserved. Registered in England and Wales. Company Number 8933205. thesai.org