Showing 1 - 20 results of 182 for search 'packing problems', query time: 0.07s Refine Results
  1. 1

    On some packing and partition problems in geometric graphs by Trao, Hazim Michman

    Published 2018
    “…Graph packing problem refers to the problem of finding maximum number of edge-disjoint copies of a fixed subgraph in a given graph G. …”
    Get full text
    Thesis
  2. 2
  3. 3

    State-of-the-art review on 3D bin packing problems by Avataram Venkatavaradan Prituja

    Published 2021
    “…This dissertation provides a comprehensive review of the state-of-the-art literature related to 3-D bin packing problems. The main purpose is twofold. First, to identify the strengths and weaknesses of the contributions in the literature. …”
    Get full text
    Thesis-Master by Coursework
  4. 4

    A Genetic Algorithm for Two-Dimensional Bin Packing Problem by Lee, Lai Soon

    Published 2008
    “…This paper considers a non-oriented twodimensional bin packing problem, where a set of small rectangles, which may be rotated by 90°, has to be allocated to one or more identical bins. …”
    Get full text
    Article
  5. 5

    Heuristic placement routines for two-dimensional bin packing problem. by Wong, L., Lee, Lai Soon

    Published 2009
    “…Problem statement: Cutting and packing (C and P) problems are optimization problems that are concerned in finding a good arrangement of multiple small items into one or more larger objects. …”
    Get full text
    Article
  6. 6

    Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem by Sarabian, Maryam

    Published 2010
    “…Bin Packing Problem is a branch of Cutting and Packing problems which has many applications in wood and metal industries. …”
    Get full text
    Thesis
  7. 7

    Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems by Wong, Lily

    Published 2009
    “…In this study, we consider non-oriented and oriented cases of Two-Dimensional Rectangular Bin Packing Problems where a given set of small rectangles is packed without overlaps into a minimum number of identical large rectangles. …”
    Get full text
    Thesis
  8. 8

    A review on learning to solve combinatorial optimisation problems in manufacturing by Zhang, Cong, Wu, Yaoxin, Ma, Yining, Song, Wen, Le, Zhang, Cao, Zhiguang, Zhang, Jie

    Published 2024
    “…This study thoroughly reviews how ML, specifically deep (reinforcement) learning, motivates new ideas for addressing challenging problems in manufacturing systems. We collect the literature targeting three aspects: scheduling, packing, and routing, which correspond to three pivotal cooperative production links of today's manufacturing system, that is, production, packing, and logistics respectively. …”
    Get full text
    Journal Article
  9. 9

    A modified partially mapped multiCrossover genetic algorithm for Two-Dimensional Bin Packing Problem by Sarabian, Maryam, Lee, Lai Soon

    Published 2010
    “…Problem statement: Non-oriented case of Two-Dimensional Rectangular Bin Packing Problem (2DRBPP) was studied in this study. …”
    Article
  10. 10

    GA based hybrid tier packing approach for three dimensional packing by Poh, Terence Eng Hua

    Published 2008
    “…This thesis proposed the Hybrid Tier Packing Approach for solving three dimensional packing problems. …”
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13

    Internet-of-things smart-packs for medication adherence by Ching, Ming Yang

    Published 2023
    “…The Smart Blister Packs contains a drug blister pack and a microcontroller that transmits information to the application and the cloud. …”
    Get full text
    Final Year Project (FYP)
  14. 14
  15. 15

    A Packing-Line Productivity Assessment of Particleboard Furniture by Tan, Jih Tsair

    Published 2003
    “…The result showed that production planning, packing flow chart and work design (55%), insufficient of raw and supporting materials (21%), and the problems related to quality (14%) are the three most influencing factors to the productivity of packing lines, followed by insufficient of manpower arrangement (6%) and machinery breakdown (4%).…”
    Get full text
    Project Paper Report
  16. 16

    Generalized sphere-packing bound for subblock-constrained codes by Kiah, Han Mao, Tandon, Anshoo, Motani, Mehul

    Published 2022
    “…We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. …”
    Get full text
    Journal Article
  17. 17
  18. 18

    Design detachable power pack for manual wheel chair by Loo, Yan Hui.

    Published 2011
    “…The improvement of the selected concept was continued under the Enhancement Design phase by identifying the complications on the use of the power pack. Thus, provides a solution for each problem. …”
    Get full text
    Final Year Project (FYP)
  19. 19

    Packing 1-plane Hamiltonian cycles in complete geometric graphs by Trao, Hazim Michman, Ali, Niran Abbas, Chia, Gek L., Kilicman, Adem

    Published 2019
    “…We consider the following question: For any set P of n points in the plane, how many 1-plane Hamiltonian cycles can be packed into a complete geometric graph Kn? We investigate the problem by taking two different situations of P, namely, when P is in convex position, wheel configurations position. …”
    Get full text
    Article
  20. 20

    Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation by Ren, Runtian, Tang, Xueyan, Li, Yusen, Cai, Wentong

    Published 2017
    “…The above job dispatching problem can be modeled as a variant of the dynamic bin packing (DBP) problem known as MinUsageTime DBP. …”
    Get full text
    Get full text
    Journal Article