Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(bin packing). Showing records 1 – 30 of 59 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Levels

▼ Search Limiters


University of Manitoba

1. Driedger, Matthew. Palletization method for oversized part stacking with an industrial robotic arm.

Degree: Mechanical Engineering, 2017, University of Manitoba

 This work explores a novel palletization strategy for an industrial robot that allows parts to overhang from the edges of a bin while maintaining stack… (more)

Subjects/Keywords: Palletizing; Bin Packing; Automation; Robotics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Driedger, M. (2017). Palletization method for oversized part stacking with an industrial robotic arm. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/32962

Chicago Manual of Style (16th Edition):

Driedger, Matthew. “Palletization method for oversized part stacking with an industrial robotic arm.” 2017. Masters Thesis, University of Manitoba. Accessed October 31, 2020. http://hdl.handle.net/1993/32962.

MLA Handbook (7th Edition):

Driedger, Matthew. “Palletization method for oversized part stacking with an industrial robotic arm.” 2017. Web. 31 Oct 2020.

Vancouver:

Driedger M. Palletization method for oversized part stacking with an industrial robotic arm. [Internet] [Masters thesis]. University of Manitoba; 2017. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/1993/32962.

Council of Science Editors:

Driedger M. Palletization method for oversized part stacking with an industrial robotic arm. [Masters Thesis]. University of Manitoba; 2017. Available from: http://hdl.handle.net/1993/32962

2. Casazza, Marco. Algorithms for Optimization Problems with Fractional Resources : Algorithmes pour des problèmes d'optimisation avec des ressources fractionnaires.

Degree: Docteur es, Informatique, 2016, Sorbonne Paris Cité; Università degli studi (Milan, Italie)

Dans cette thèse nous considérons une classe de problèmes d’optimisation ayant une particularité : des décisions à la fois discrètes et continues doivent être prises… (more)

Subjects/Keywords: Affectation de ressources; Bin Packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Casazza, M. (2016). Algorithms for Optimization Problems with Fractional Resources : Algorithmes pour des problèmes d'optimisation avec des ressources fractionnaires. (Doctoral Dissertation). Sorbonne Paris Cité; Università degli studi (Milan, Italie). Retrieved from http://www.theses.fr/2016USPCD048

Chicago Manual of Style (16th Edition):

Casazza, Marco. “Algorithms for Optimization Problems with Fractional Resources : Algorithmes pour des problèmes d'optimisation avec des ressources fractionnaires.” 2016. Doctoral Dissertation, Sorbonne Paris Cité; Università degli studi (Milan, Italie). Accessed October 31, 2020. http://www.theses.fr/2016USPCD048.

MLA Handbook (7th Edition):

Casazza, Marco. “Algorithms for Optimization Problems with Fractional Resources : Algorithmes pour des problèmes d'optimisation avec des ressources fractionnaires.” 2016. Web. 31 Oct 2020.

Vancouver:

Casazza M. Algorithms for Optimization Problems with Fractional Resources : Algorithmes pour des problèmes d'optimisation avec des ressources fractionnaires. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; Università degli studi (Milan, Italie); 2016. [cited 2020 Oct 31]. Available from: http://www.theses.fr/2016USPCD048.

Council of Science Editors:

Casazza M. Algorithms for Optimization Problems with Fractional Resources : Algorithmes pour des problèmes d'optimisation avec des ressources fractionnaires. [Doctoral Dissertation]. Sorbonne Paris Cité; Università degli studi (Milan, Italie); 2016. Available from: http://www.theses.fr/2016USPCD048


Delft University of Technology

3. van Aken, Margot (author). An efficient bin-packing algorithm applied to packing groceries in a fulfillment center.

Degree: 2019, Delft University of Technology

We have tried to create a bin-packing algorithm that assigns items from a customer-order to totes such that the amount of totes is minimized. Analyzing… (more)

Subjects/Keywords: Bin-packing; heuristic; groceries

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

van Aken, M. (. (2019). An efficient bin-packing algorithm applied to packing groceries in a fulfillment center. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:f4ee26b5-b94e-4cd3-9c7a-c281b0c8d8a8

Chicago Manual of Style (16th Edition):

van Aken, Margot (author). “An efficient bin-packing algorithm applied to packing groceries in a fulfillment center.” 2019. Masters Thesis, Delft University of Technology. Accessed October 31, 2020. http://resolver.tudelft.nl/uuid:f4ee26b5-b94e-4cd3-9c7a-c281b0c8d8a8.

MLA Handbook (7th Edition):

van Aken, Margot (author). “An efficient bin-packing algorithm applied to packing groceries in a fulfillment center.” 2019. Web. 31 Oct 2020.

Vancouver:

van Aken M(. An efficient bin-packing algorithm applied to packing groceries in a fulfillment center. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Oct 31]. Available from: http://resolver.tudelft.nl/uuid:f4ee26b5-b94e-4cd3-9c7a-c281b0c8d8a8.

Council of Science Editors:

van Aken M(. An efficient bin-packing algorithm applied to packing groceries in a fulfillment center. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:f4ee26b5-b94e-4cd3-9c7a-c281b0c8d8a8

4. Lemos, Felipe Kesrouani. Problema de programação de uma operação de empacotamento não-guilhotinado em ambiente de máquina única, minimizando custos de matéria-prima e desvio de datas: formulação e solução heurística.

Degree: Mestrado, Engenharia de Produção, 2013, University of São Paulo

A presente pesquisa tem como objetivo estudar a integração entre dois temas clássicos da literatura de pesquisa operacional e gestão de operações: problemas de corte… (more)

Subjects/Keywords: Bin packing; Bin packing; Corte e empacotamento (Cutting and packing); Cutting and packing; Production scheduling; Programação da produção (Scheduling)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lemos, F. K. (2013). Problema de programação de uma operação de empacotamento não-guilhotinado em ambiente de máquina única, minimizando custos de matéria-prima e desvio de datas: formulação e solução heurística. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3136/tde-11072014-121631/ ;

Chicago Manual of Style (16th Edition):

Lemos, Felipe Kesrouani. “Problema de programação de uma operação de empacotamento não-guilhotinado em ambiente de máquina única, minimizando custos de matéria-prima e desvio de datas: formulação e solução heurística.” 2013. Masters Thesis, University of São Paulo. Accessed October 31, 2020. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-11072014-121631/ ;.

MLA Handbook (7th Edition):

Lemos, Felipe Kesrouani. “Problema de programação de uma operação de empacotamento não-guilhotinado em ambiente de máquina única, minimizando custos de matéria-prima e desvio de datas: formulação e solução heurística.” 2013. Web. 31 Oct 2020.

Vancouver:

Lemos FK. Problema de programação de uma operação de empacotamento não-guilhotinado em ambiente de máquina única, minimizando custos de matéria-prima e desvio de datas: formulação e solução heurística. [Internet] [Masters thesis]. University of São Paulo; 2013. [cited 2020 Oct 31]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3136/tde-11072014-121631/ ;.

Council of Science Editors:

Lemos FK. Problema de programação de uma operação de empacotamento não-guilhotinado em ambiente de máquina única, minimizando custos de matéria-prima e desvio de datas: formulação e solução heurística. [Masters Thesis]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/3/3136/tde-11072014-121631/ ;


Brno University of Technology

5. Vacek, Michal. Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport.

Degree: 2020, Brno University of Technology

 This bachelor thesis treats of application of stuff placing optimization for transport. Application is developed in cooperation with Škoda Auto a.s., which solves the problem… (more)

Subjects/Keywords: Optimalizace; uložení materiálu; Knapsack; Bin-packing problem; Optimalization; stuff placing; Knapsack; Bin-packing problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vacek, M. (2020). Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187957

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vacek, Michal. “Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport.” 2020. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/187957.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vacek, Michal. “Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport.” 2020. Web. 31 Oct 2020.

Vancouver:

Vacek M. Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/187957.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vacek M. Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187957

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

6. Vacek, Michal. Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport.

Degree: 2019, Brno University of Technology

 This bachelor thesis treats of application of stuff placing optimization for transport. Application is developed in cooperation with Škoda Auto a.s., which solves the problem… (more)

Subjects/Keywords: Optimalizace; uložení materiálu; Knapsack; Bin-packing problem; Optimalization; stuff placing; Knapsack; Bin-packing problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vacek, M. (2019). Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56357

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vacek, Michal. “Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport.” 2019. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/56357.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vacek, Michal. “Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport.” 2019. Web. 31 Oct 2020.

Vancouver:

Vacek M. Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/56357.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vacek M. Optimalizace uložení materiálu pro přepravu: Stuff Placing Optimization for Transport. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/56357

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia Tech

7. Asgeirsson, Agni. On-line algorithms for bin-covering problems with known item distributions.

Degree: PhD, Industrial and Systems Engineering, 2014, Georgia Tech

 This thesis focuses on algorithms solving the on-line Bin-Covering problem, when the items are generated from a known, stationary distribution. We introduce the Prospect Algorithm.… (more)

Subjects/Keywords: Bin-covering; Bin-packing; Algorithms; Markov decision processies; MDP; Simulation; Knapsack; Next-fit; Inspection theorem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Asgeirsson, A. (2014). On-line algorithms for bin-covering problems with known item distributions. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53413

Chicago Manual of Style (16th Edition):

Asgeirsson, Agni. “On-line algorithms for bin-covering problems with known item distributions.” 2014. Doctoral Dissertation, Georgia Tech. Accessed October 31, 2020. http://hdl.handle.net/1853/53413.

MLA Handbook (7th Edition):

Asgeirsson, Agni. “On-line algorithms for bin-covering problems with known item distributions.” 2014. Web. 31 Oct 2020.

Vancouver:

Asgeirsson A. On-line algorithms for bin-covering problems with known item distributions. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/1853/53413.

Council of Science Editors:

Asgeirsson A. On-line algorithms for bin-covering problems with known item distributions. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/53413


NSYSU

8. Huang, Tzu-Hua. The study of virtual machine deployment in cloud computing platform.

Degree: Master, Computer Science and Engineering, 2015, NSYSU

 Nowadays cloud-computing is the hottest topics in the study of Internet. Through internet connection, it provided calculation service and allowed both software/hardware resources sharing and… (more)

Subjects/Keywords: Cloud Computing; Docker; Swarm; PaaS; Bin-Packing; Real-Time Service

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Huang, T. (2015). The study of virtual machine deployment in cloud computing platform. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627115-122915

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Huang, Tzu-Hua. “The study of virtual machine deployment in cloud computing platform.” 2015. Thesis, NSYSU. Accessed October 31, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627115-122915.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Huang, Tzu-Hua. “The study of virtual machine deployment in cloud computing platform.” 2015. Web. 31 Oct 2020.

Vancouver:

Huang T. The study of virtual machine deployment in cloud computing platform. [Internet] [Thesis]. NSYSU; 2015. [cited 2020 Oct 31]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627115-122915.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang T. The study of virtual machine deployment in cloud computing platform. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627115-122915

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Louisville

9. Dieder, Sonja. A heuristic algorithm for determining the part set in a powder-bed additive manufacturing machine.

Degree: PhD, 2014, University of Louisville

  The goal of this research is to develop a procedure for the placement of a priority part into a planned build in a powder-bed… (more)

Subjects/Keywords: Additive manufacturing; Powder-bed; Bin packing; Revenue maximization; Optimization; Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dieder, S. (2014). A heuristic algorithm for determining the part set in a powder-bed additive manufacturing machine. (Doctoral Dissertation). University of Louisville. Retrieved from 10.18297/etd/345 ; https://ir.library.louisville.edu/etd/345

Chicago Manual of Style (16th Edition):

Dieder, Sonja. “A heuristic algorithm for determining the part set in a powder-bed additive manufacturing machine.” 2014. Doctoral Dissertation, University of Louisville. Accessed October 31, 2020. 10.18297/etd/345 ; https://ir.library.louisville.edu/etd/345.

MLA Handbook (7th Edition):

Dieder, Sonja. “A heuristic algorithm for determining the part set in a powder-bed additive manufacturing machine.” 2014. Web. 31 Oct 2020.

Vancouver:

Dieder S. A heuristic algorithm for determining the part set in a powder-bed additive manufacturing machine. [Internet] [Doctoral dissertation]. University of Louisville; 2014. [cited 2020 Oct 31]. Available from: 10.18297/etd/345 ; https://ir.library.louisville.edu/etd/345.

Council of Science Editors:

Dieder S. A heuristic algorithm for determining the part set in a powder-bed additive manufacturing machine. [Doctoral Dissertation]. University of Louisville; 2014. Available from: 10.18297/etd/345 ; https://ir.library.louisville.edu/etd/345

10. Rajesh kanna S K. Hybrid genetic algorithm for 3D heterogeneous arbitrary sized bin packing problem with practical constraints;.

Degree: Hybrid genetic algorithm for 3D heterogeneous arbitrary sized bin packing problem with practical constraints, 2014, Anna University

This research presents an algorithm which combines Genetic newlineAlgorithm (GA) with Tuning Algorithm (TA) for optimizing Three newlineDimensional (3D) packing of arbitrary sized heterogeneous bins… (more)

Subjects/Keywords: 3D bin packing problem; Hybrid genetic algorithm; Mathematics

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

K, R. k. S. (2014). Hybrid genetic algorithm for 3D heterogeneous arbitrary sized bin packing problem with practical constraints;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/17397

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

K, Rajesh kanna S. “Hybrid genetic algorithm for 3D heterogeneous arbitrary sized bin packing problem with practical constraints;.” 2014. Thesis, Anna University. Accessed October 31, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/17397.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

K, Rajesh kanna S. “Hybrid genetic algorithm for 3D heterogeneous arbitrary sized bin packing problem with practical constraints;.” 2014. Web. 31 Oct 2020.

Vancouver:

K RkS. Hybrid genetic algorithm for 3D heterogeneous arbitrary sized bin packing problem with practical constraints;. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Oct 31]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17397.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

K RkS. Hybrid genetic algorithm for 3D heterogeneous arbitrary sized bin packing problem with practical constraints;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17397

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas A&M University

11. Li, Xiafeng. On Discrete Hyperbox Packing.

Degree: PhD, Computer Science, 2010, Texas A&M University

Bin packing is a very important and popular research area in the computer science field. Past work showed many good and real-world packing algorithms. How-… (more)

Subjects/Keywords: bin packing; approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Li, X. (2010). On Discrete Hyperbox Packing. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186

Chicago Manual of Style (16th Edition):

Li, Xiafeng. “On Discrete Hyperbox Packing.” 2010. Doctoral Dissertation, Texas A&M University. Accessed October 31, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186.

MLA Handbook (7th Edition):

Li, Xiafeng. “On Discrete Hyperbox Packing.” 2010. Web. 31 Oct 2020.

Vancouver:

Li X. On Discrete Hyperbox Packing. [Internet] [Doctoral dissertation]. Texas A&M University; 2010. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186.

Council of Science Editors:

Li X. On Discrete Hyperbox Packing. [Doctoral Dissertation]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186


North Carolina State University

12. Riego, Dustin Bowers. Optimization of Vehicle Routes for a Third Party Logistics Provider.

Degree: MS, Industrial Engineering, 2005, North Carolina State University

 This work addresses the problem of minimizing the number of vehicles required to service a weekly delivery schedule for a transportation company. The characteristics of… (more)

Subjects/Keywords: VRP; vehicle routing; bin packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Riego, D. B. (2005). Optimization of Vehicle Routes for a Third Party Logistics Provider. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/2752

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Riego, Dustin Bowers. “Optimization of Vehicle Routes for a Third Party Logistics Provider.” 2005. Thesis, North Carolina State University. Accessed October 31, 2020. http://www.lib.ncsu.edu/resolver/1840.16/2752.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Riego, Dustin Bowers. “Optimization of Vehicle Routes for a Third Party Logistics Provider.” 2005. Web. 31 Oct 2020.

Vancouver:

Riego DB. Optimization of Vehicle Routes for a Third Party Logistics Provider. [Internet] [Thesis]. North Carolina State University; 2005. [cited 2020 Oct 31]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2752.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Riego DB. Optimization of Vehicle Routes for a Third Party Logistics Provider. [Thesis]. North Carolina State University; 2005. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2752

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Azam, Bilal. Three-dimensional bin packing method for intelligent sorting of over-sized parts in a robot cell.

Degree: Mechanical Engineering, 2018, University of Manitoba

 This thesis presents the development of a model for a unique bin packing and stacking of parts.The methodology developed is applied to a problem in… (more)

Subjects/Keywords: Bin Packing; Palletization

…uniformity in sizes of the parts, this problem does not fit under the normal bin packing methods… …definition in section 3.2. 1.2. Bin Packing & Palletization In automated production, parts are… …storage problem are named as bin packing problem. It involves packing the items in bins or… …literature such as strip or bin packing problem, pallet loading problem or palletization, nesting… …problem etc. Three types of classifications are presented for bin packing problem: single bin… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Azam, B. (2018). Three-dimensional bin packing method for intelligent sorting of over-sized parts in a robot cell. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/33701

Chicago Manual of Style (16th Edition):

Azam, Bilal. “Three-dimensional bin packing method for intelligent sorting of over-sized parts in a robot cell.” 2018. Masters Thesis, University of Manitoba. Accessed October 31, 2020. http://hdl.handle.net/1993/33701.

MLA Handbook (7th Edition):

Azam, Bilal. “Three-dimensional bin packing method for intelligent sorting of over-sized parts in a robot cell.” 2018. Web. 31 Oct 2020.

Vancouver:

Azam B. Three-dimensional bin packing method for intelligent sorting of over-sized parts in a robot cell. [Internet] [Masters thesis]. University of Manitoba; 2018. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/1993/33701.

Council of Science Editors:

Azam B. Three-dimensional bin packing method for intelligent sorting of over-sized parts in a robot cell. [Masters Thesis]. University of Manitoba; 2018. Available from: http://hdl.handle.net/1993/33701

14. Khanafer, Ali. Algorithmes pour des problèmes de bin packing mono- et multi-objectif : Algorithms for mono- and multi-objective bin packing problems.

Degree: Docteur es, Informatique, 2010, Université Lille I – Sciences et Technologies

Le problème de bin packing consiste à déterminer le nombre minimum de conteneurs (bins) nécessaires pour ranger un ensemble d’objets. Ce problème NP- complet fait… (more)

Subjects/Keywords: Problème de bin packing; Bornes inférieures; Recherche tabou

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Khanafer, A. (2010). Algorithmes pour des problèmes de bin packing mono- et multi-objectif : Algorithms for mono- and multi-objective bin packing problems. (Doctoral Dissertation). Université Lille I – Sciences et Technologies. Retrieved from http://www.theses.fr/2010LIL10088

Chicago Manual of Style (16th Edition):

Khanafer, Ali. “Algorithmes pour des problèmes de bin packing mono- et multi-objectif : Algorithms for mono- and multi-objective bin packing problems.” 2010. Doctoral Dissertation, Université Lille I – Sciences et Technologies. Accessed October 31, 2020. http://www.theses.fr/2010LIL10088.

MLA Handbook (7th Edition):

Khanafer, Ali. “Algorithmes pour des problèmes de bin packing mono- et multi-objectif : Algorithms for mono- and multi-objective bin packing problems.” 2010. Web. 31 Oct 2020.

Vancouver:

Khanafer A. Algorithmes pour des problèmes de bin packing mono- et multi-objectif : Algorithms for mono- and multi-objective bin packing problems. [Internet] [Doctoral dissertation]. Université Lille I – Sciences et Technologies; 2010. [cited 2020 Oct 31]. Available from: http://www.theses.fr/2010LIL10088.

Council of Science Editors:

Khanafer A. Algorithmes pour des problèmes de bin packing mono- et multi-objectif : Algorithms for mono- and multi-objective bin packing problems. [Doctoral Dissertation]. Université Lille I – Sciences et Technologies; 2010. Available from: http://www.theses.fr/2010LIL10088


York University

15. Ataei, Masoud. A Branch-and-Price Algorithm for Bin Packing Problem.

Degree: MSc -MS, Applied and Industrial Mathematics, 2015, York University

Bin Packing Problem examines the minimum number of identical bins needed to pack a set of items of various sizes. Employing branch-and-bound and column generation… (more)

Subjects/Keywords: Applied mathematics; Bin Packing Problem; Branch-and-Bound; Column Generation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ataei, M. (2015). A Branch-and-Price Algorithm for Bin Packing Problem. (Masters Thesis). York University. Retrieved from http://hdl.handle.net/10315/30728

Chicago Manual of Style (16th Edition):

Ataei, Masoud. “A Branch-and-Price Algorithm for Bin Packing Problem.” 2015. Masters Thesis, York University. Accessed October 31, 2020. http://hdl.handle.net/10315/30728.

MLA Handbook (7th Edition):

Ataei, Masoud. “A Branch-and-Price Algorithm for Bin Packing Problem.” 2015. Web. 31 Oct 2020.

Vancouver:

Ataei M. A Branch-and-Price Algorithm for Bin Packing Problem. [Internet] [Masters thesis]. York University; 2015. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10315/30728.

Council of Science Editors:

Ataei M. A Branch-and-Price Algorithm for Bin Packing Problem. [Masters Thesis]. York University; 2015. Available from: http://hdl.handle.net/10315/30728


University College Cork

16. De Cauwer, Milan. Combinatorial optimisation for sustainable cloud computing.

Degree: 2018, University College Cork

 Enabled by both software and hardware advances, cloud computing has emerged as an efficient way to leverage economies of scale for building large computational infrastructures… (more)

Subjects/Keywords: Combinatorial optimisation; Cloud computing; Workload consolidation; Bin packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

De Cauwer, M. (2018). Combinatorial optimisation for sustainable cloud computing. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/6903

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

De Cauwer, Milan. “Combinatorial optimisation for sustainable cloud computing.” 2018. Thesis, University College Cork. Accessed October 31, 2020. http://hdl.handle.net/10468/6903.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

De Cauwer, Milan. “Combinatorial optimisation for sustainable cloud computing.” 2018. Web. 31 Oct 2020.

Vancouver:

De Cauwer M. Combinatorial optimisation for sustainable cloud computing. [Internet] [Thesis]. University College Cork; 2018. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10468/6903.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

De Cauwer M. Combinatorial optimisation for sustainable cloud computing. [Thesis]. University College Cork; 2018. Available from: http://hdl.handle.net/10468/6903

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Addis Ababa University

17. Ammanuel, Shawel. Analysis of Availability Using Virtual Machine Placement Algorithms for Cloud IaaS .

Degree: 2020, Addis Ababa University

 Cloud Computing paradigm is most popular for its flexibility in resource provisioning by creating virtual machines of the requested specification on the underlying physical infrastructure.… (more)

Subjects/Keywords: Cloud IaaS availability; virtual machine placement; bin packing; heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ammanuel, S. (2020). Analysis of Availability Using Virtual Machine Placement Algorithms for Cloud IaaS . (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/handle/123456789/21033

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ammanuel, Shawel. “Analysis of Availability Using Virtual Machine Placement Algorithms for Cloud IaaS .” 2020. Thesis, Addis Ababa University. Accessed October 31, 2020. http://etd.aau.edu.et/handle/123456789/21033.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ammanuel, Shawel. “Analysis of Availability Using Virtual Machine Placement Algorithms for Cloud IaaS .” 2020. Web. 31 Oct 2020.

Vancouver:

Ammanuel S. Analysis of Availability Using Virtual Machine Placement Algorithms for Cloud IaaS . [Internet] [Thesis]. Addis Ababa University; 2020. [cited 2020 Oct 31]. Available from: http://etd.aau.edu.et/handle/123456789/21033.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ammanuel S. Analysis of Availability Using Virtual Machine Placement Algorithms for Cloud IaaS . [Thesis]. Addis Ababa University; 2020. Available from: http://etd.aau.edu.et/handle/123456789/21033

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

18. Kamali, Shahin. Alternative Approaches for Analysis of Bin Packing and List Update Problems.

Degree: 2014, University of Waterloo

 In this thesis we introduce and evaluate new algorithms and models for the analysis of online bin packing and list update problems. These are two… (more)

Subjects/Keywords: Online Algorithms; Competitive Analysis; Bin Packing; List Update; Compression; Server Consolidation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kamali, S. (2014). Alternative Approaches for Analysis of Bin Packing and List Update Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8843

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kamali, Shahin. “Alternative Approaches for Analysis of Bin Packing and List Update Problems.” 2014. Thesis, University of Waterloo. Accessed October 31, 2020. http://hdl.handle.net/10012/8843.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kamali, Shahin. “Alternative Approaches for Analysis of Bin Packing and List Update Problems.” 2014. Web. 31 Oct 2020.

Vancouver:

Kamali S. Alternative Approaches for Analysis of Bin Packing and List Update Problems. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10012/8843.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kamali S. Alternative Approaches for Analysis of Bin Packing and List Update Problems. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8843

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

19. Shraideh, Ahmad. Analyse et optimisation d'un processus à partir d'un modèle BPMN dans une démarche globale de conception et de développement d'un processus métier : application à la dématérialisation de flux courrier du projet GOCD (PICOM) : Integrating a business process analysis and optimization step using BPMN model in a general process design and development approach : application to a paperless mail flow process.

Degree: Docteur es, Automatique et informatique industrielle, 2009, Ecole centrale de Lille

Cette thèse a été réalisée dans le cadre du projet « Gestion et Optimisation de la Chaîne Documentaire », projet labellisé par le Pôle de… (more)

Subjects/Keywords: Workflow; Bpmn; Management de processus métier; Réseaux de Petri; Vérification; Optimisation; Problème de Bin Packing; Bpel; Workflow; Bpmn; Business process management; Petri nets; Verification; Optimization; Bin Packing Problem; Bpel

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shraideh, A. (2009). Analyse et optimisation d'un processus à partir d'un modèle BPMN dans une démarche globale de conception et de développement d'un processus métier : application à la dématérialisation de flux courrier du projet GOCD (PICOM) : Integrating a business process analysis and optimization step using BPMN model in a general process design and development approach : application to a paperless mail flow process. (Doctoral Dissertation). Ecole centrale de Lille. Retrieved from http://www.theses.fr/2009ECLI0021

Chicago Manual of Style (16th Edition):

Shraideh, Ahmad. “Analyse et optimisation d'un processus à partir d'un modèle BPMN dans une démarche globale de conception et de développement d'un processus métier : application à la dématérialisation de flux courrier du projet GOCD (PICOM) : Integrating a business process analysis and optimization step using BPMN model in a general process design and development approach : application to a paperless mail flow process.” 2009. Doctoral Dissertation, Ecole centrale de Lille. Accessed October 31, 2020. http://www.theses.fr/2009ECLI0021.

MLA Handbook (7th Edition):

Shraideh, Ahmad. “Analyse et optimisation d'un processus à partir d'un modèle BPMN dans une démarche globale de conception et de développement d'un processus métier : application à la dématérialisation de flux courrier du projet GOCD (PICOM) : Integrating a business process analysis and optimization step using BPMN model in a general process design and development approach : application to a paperless mail flow process.” 2009. Web. 31 Oct 2020.

Vancouver:

Shraideh A. Analyse et optimisation d'un processus à partir d'un modèle BPMN dans une démarche globale de conception et de développement d'un processus métier : application à la dématérialisation de flux courrier du projet GOCD (PICOM) : Integrating a business process analysis and optimization step using BPMN model in a general process design and development approach : application to a paperless mail flow process. [Internet] [Doctoral dissertation]. Ecole centrale de Lille; 2009. [cited 2020 Oct 31]. Available from: http://www.theses.fr/2009ECLI0021.

Council of Science Editors:

Shraideh A. Analyse et optimisation d'un processus à partir d'un modèle BPMN dans une démarche globale de conception et de développement d'un processus métier : application à la dématérialisation de flux courrier du projet GOCD (PICOM) : Integrating a business process analysis and optimization step using BPMN model in a general process design and development approach : application to a paperless mail flow process. [Doctoral Dissertation]. Ecole centrale de Lille; 2009. Available from: http://www.theses.fr/2009ECLI0021


Vilnius Pedagogical University

20. Matkevičius, Audrius. Vienmačio supjaustymo uždaviniai.

Degree: Master, Informatics, 2005, Vilnius Pedagogical University

 The purpose of bin packing is the effective apportionment of smaller elements in the bigger ones. The bin packing is being analysed in managment, computers,… (more)

Subjects/Keywords: Bin; Supjaustymo uždaviniai; Juostų pjaustymas; Packing; Vienmatis supjaustumas; Algoritmas; Bin Packing; Bins

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Matkevičius, Audrius. (2005). Vienmačio supjaustymo uždaviniai. (Masters Thesis). Vilnius Pedagogical University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2005~D_20050609_143028-57047 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Matkevičius, Audrius. “Vienmačio supjaustymo uždaviniai.” 2005. Masters Thesis, Vilnius Pedagogical University. Accessed October 31, 2020. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2005~D_20050609_143028-57047 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Matkevičius, Audrius. “Vienmačio supjaustymo uždaviniai.” 2005. Web. 31 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Matkevičius, Audrius. Vienmačio supjaustymo uždaviniai. [Internet] [Masters thesis]. Vilnius Pedagogical University; 2005. [cited 2020 Oct 31]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2005~D_20050609_143028-57047 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Matkevičius, Audrius. Vienmačio supjaustymo uždaviniai. [Masters Thesis]. Vilnius Pedagogical University; 2005. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2005~D_20050609_143028-57047 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


Université de Lorraine

21. Bouzoubaa, Yahya. Méthodes exactes et heuristiques pour l’optimisation de l’agencement d’un logement : application aux situations de handicap : Exact and heuristic methods for optimizing the layout of an apartment : application to situations of disability.

Degree: Docteur es, Informatique, 2017, Université de Lorraine

 Le volet applicatif de cette thèse porte sur l'agencement d'un logement destiné à une personne en situation de handicap. L'agencement désigne le choix de la… (more)

Subjects/Keywords: Optimisation combinatoire; Modélisation mathématique; Métaheuristique; Placement 2D; Bin packing; Handicap; Combinatorial optimization; Mathematic modelling; Metaheuristic; Placement 2D; Bin packing; Handicap; 006.3; 643

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bouzoubaa, Y. (2017). Méthodes exactes et heuristiques pour l’optimisation de l’agencement d’un logement : application aux situations de handicap : Exact and heuristic methods for optimizing the layout of an apartment : application to situations of disability. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2017LORR0369

Chicago Manual of Style (16th Edition):

Bouzoubaa, Yahya. “Méthodes exactes et heuristiques pour l’optimisation de l’agencement d’un logement : application aux situations de handicap : Exact and heuristic methods for optimizing the layout of an apartment : application to situations of disability.” 2017. Doctoral Dissertation, Université de Lorraine. Accessed October 31, 2020. http://www.theses.fr/2017LORR0369.

MLA Handbook (7th Edition):

Bouzoubaa, Yahya. “Méthodes exactes et heuristiques pour l’optimisation de l’agencement d’un logement : application aux situations de handicap : Exact and heuristic methods for optimizing the layout of an apartment : application to situations of disability.” 2017. Web. 31 Oct 2020.

Vancouver:

Bouzoubaa Y. Méthodes exactes et heuristiques pour l’optimisation de l’agencement d’un logement : application aux situations de handicap : Exact and heuristic methods for optimizing the layout of an apartment : application to situations of disability. [Internet] [Doctoral dissertation]. Université de Lorraine; 2017. [cited 2020 Oct 31]. Available from: http://www.theses.fr/2017LORR0369.

Council of Science Editors:

Bouzoubaa Y. Méthodes exactes et heuristiques pour l’optimisation de l’agencement d’un logement : application aux situations de handicap : Exact and heuristic methods for optimizing the layout of an apartment : application to situations of disability. [Doctoral Dissertation]. Université de Lorraine; 2017. Available from: http://www.theses.fr/2017LORR0369


RMIT University

22. Turky, A. Bi-level hyper-heuristic approaches for combinatorial optimisation problems.

Degree: 2019, RMIT University

 Many real-world combinatorial optimisation problems (COPs) are too complex to be handled in polynomial time using exact methods. One way to solve such problems is… (more)

Subjects/Keywords: Fields of Research; hyper-heuristic; combinatorial optimisation problems; multi-capacity bin packing problem; google machine reassignment problem; bi-level; bin packing problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Turky, A. (2019). Bi-level hyper-heuristic approaches for combinatorial optimisation problems. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162875

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Turky, A. “Bi-level hyper-heuristic approaches for combinatorial optimisation problems.” 2019. Thesis, RMIT University. Accessed October 31, 2020. http://researchbank.rmit.edu.au/view/rmit:162875.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Turky, A. “Bi-level hyper-heuristic approaches for combinatorial optimisation problems.” 2019. Web. 31 Oct 2020.

Vancouver:

Turky A. Bi-level hyper-heuristic approaches for combinatorial optimisation problems. [Internet] [Thesis]. RMIT University; 2019. [cited 2020 Oct 31]. Available from: http://researchbank.rmit.edu.au/view/rmit:162875.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Turky A. Bi-level hyper-heuristic approaches for combinatorial optimisation problems. [Thesis]. RMIT University; 2019. Available from: http://researchbank.rmit.edu.au/view/rmit:162875

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Antomarchi, Anne-Lise. Conception et pilotage d'un atelier intégrant la fabrication additive : Design and management of a workshop integrating additive manufacturing.

Degree: Docteur es, Informatique, 2019, Clermont Auvergne

La fabrication additive est un domaine en plein essor. Cependant, les industriels sont aujourd’hui dans une phase d’interrogation sur l’utilisation de ce procédé dans le… (more)

Subjects/Keywords: Aide à la décision; Incertain; Optimisation multicritère; Planification stratégique; Modèle de coûts; Simulation; Ordonnancement; Bin packing; Decision-making; Uncertain; Multicriteria optimization; Strategic planning; Cost model; Scheduling; Bin packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Antomarchi, A. (2019). Conception et pilotage d'un atelier intégrant la fabrication additive : Design and management of a workshop integrating additive manufacturing. (Doctoral Dissertation). Clermont Auvergne. Retrieved from http://www.theses.fr/2019CLFAC035

Chicago Manual of Style (16th Edition):

Antomarchi, Anne-Lise. “Conception et pilotage d'un atelier intégrant la fabrication additive : Design and management of a workshop integrating additive manufacturing.” 2019. Doctoral Dissertation, Clermont Auvergne. Accessed October 31, 2020. http://www.theses.fr/2019CLFAC035.

MLA Handbook (7th Edition):

Antomarchi, Anne-Lise. “Conception et pilotage d'un atelier intégrant la fabrication additive : Design and management of a workshop integrating additive manufacturing.” 2019. Web. 31 Oct 2020.

Vancouver:

Antomarchi A. Conception et pilotage d'un atelier intégrant la fabrication additive : Design and management of a workshop integrating additive manufacturing. [Internet] [Doctoral dissertation]. Clermont Auvergne; 2019. [cited 2020 Oct 31]. Available from: http://www.theses.fr/2019CLFAC035.

Council of Science Editors:

Antomarchi A. Conception et pilotage d'un atelier intégrant la fabrication additive : Design and management of a workshop integrating additive manufacturing. [Doctoral Dissertation]. Clermont Auvergne; 2019. Available from: http://www.theses.fr/2019CLFAC035

24. El Yaagoubi, Amina. Contribution à l'optimisation du chargement et du déchargement des conteneurs dans le cas des transports routier et fluvial : Contribution to the optimization of loading and unloading og containers in the case of road and river transport.

Degree: Docteur es, Informatique, 2019, Normandie; Université Sidi Mohamed ben Abdellah (Fès, Maroc). Faculté des lettres (Saïs-Fès, Maroc)

Dans ce mémoire, nous nous intéressons à l’optimisation des mouvements improductifs de chargement/déchargement, appelés shiftings, dans les problèmes de transport. Dans le premier contexte,nous introduisons… (more)

Subjects/Keywords: Shifting; Conteneurs; Barge; Programmation mathématique; Bin-packing; Optimisation multi-objectif; ACO-parallèle; NSGA-II; Shifting; Container; Barge; Mathematical programming; Bin-packing; Multi-objective optimization; Parallel-ACO; NSGA-II

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

El Yaagoubi, A. (2019). Contribution à l'optimisation du chargement et du déchargement des conteneurs dans le cas des transports routier et fluvial : Contribution to the optimization of loading and unloading og containers in the case of road and river transport. (Doctoral Dissertation). Normandie; Université Sidi Mohamed ben Abdellah (Fès, Maroc). Faculté des lettres (Saïs-Fès, Maroc). Retrieved from http://www.theses.fr/2019NORMLH01

Chicago Manual of Style (16th Edition):

El Yaagoubi, Amina. “Contribution à l'optimisation du chargement et du déchargement des conteneurs dans le cas des transports routier et fluvial : Contribution to the optimization of loading and unloading og containers in the case of road and river transport.” 2019. Doctoral Dissertation, Normandie; Université Sidi Mohamed ben Abdellah (Fès, Maroc). Faculté des lettres (Saïs-Fès, Maroc). Accessed October 31, 2020. http://www.theses.fr/2019NORMLH01.

MLA Handbook (7th Edition):

El Yaagoubi, Amina. “Contribution à l'optimisation du chargement et du déchargement des conteneurs dans le cas des transports routier et fluvial : Contribution to the optimization of loading and unloading og containers in the case of road and river transport.” 2019. Web. 31 Oct 2020.

Vancouver:

El Yaagoubi A. Contribution à l'optimisation du chargement et du déchargement des conteneurs dans le cas des transports routier et fluvial : Contribution to the optimization of loading and unloading og containers in the case of road and river transport. [Internet] [Doctoral dissertation]. Normandie; Université Sidi Mohamed ben Abdellah (Fès, Maroc). Faculté des lettres (Saïs-Fès, Maroc); 2019. [cited 2020 Oct 31]. Available from: http://www.theses.fr/2019NORMLH01.

Council of Science Editors:

El Yaagoubi A. Contribution à l'optimisation du chargement et du déchargement des conteneurs dans le cas des transports routier et fluvial : Contribution to the optimization of loading and unloading og containers in the case of road and river transport. [Doctoral Dissertation]. Normandie; Université Sidi Mohamed ben Abdellah (Fès, Maroc). Faculté des lettres (Saïs-Fès, Maroc); 2019. Available from: http://www.theses.fr/2019NORMLH01


University of Waterloo

25. de Carvalho, Paulo R. V. A data-driven optimization approach for mixed-case palletization and three-dimensional bin packing.

Degree: 2018, University of Waterloo

 Palletization is the most standard method of packaging and transportation in the retail industry. Their building involves the solution of a three-dimensional packing problem with… (more)

Subjects/Keywords: data analytics; mixed-case palletization; three-dimensional bin packing; mixed-integer programing; 3DBPP; MIP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

de Carvalho, P. R. V. (2018). A data-driven optimization approach for mixed-case palletization and three-dimensional bin packing. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12891

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

de Carvalho, Paulo R V. “A data-driven optimization approach for mixed-case palletization and three-dimensional bin packing.” 2018. Thesis, University of Waterloo. Accessed October 31, 2020. http://hdl.handle.net/10012/12891.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

de Carvalho, Paulo R V. “A data-driven optimization approach for mixed-case palletization and three-dimensional bin packing.” 2018. Web. 31 Oct 2020.

Vancouver:

de Carvalho PRV. A data-driven optimization approach for mixed-case palletization and three-dimensional bin packing. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10012/12891.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

de Carvalho PRV. A data-driven optimization approach for mixed-case palletization and three-dimensional bin packing. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/12891

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

26. Yildiz, Burak Can. Models and Solution Methods for the Pallet Loading Problem.

Degree: 2018, University of Waterloo

 The three-dimensional bin packing problem (3DBPP) seeks to find the minimum number of bins to pack a finite number of rectangular boxes. It has a… (more)

Subjects/Keywords: 3D Bin Packing; Pallet Loading; Warehousing; Branch-and-Price; Column Generation; Layering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yildiz, B. C. (2018). Models and Solution Methods for the Pallet Loading Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13243

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Yildiz, Burak Can. “Models and Solution Methods for the Pallet Loading Problem.” 2018. Thesis, University of Waterloo. Accessed October 31, 2020. http://hdl.handle.net/10012/13243.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Yildiz, Burak Can. “Models and Solution Methods for the Pallet Loading Problem.” 2018. Web. 31 Oct 2020.

Vancouver:

Yildiz BC. Models and Solution Methods for the Pallet Loading Problem. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10012/13243.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yildiz BC. Models and Solution Methods for the Pallet Loading Problem. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13243

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


North Carolina State University

27. Nagarajan, Rajesh P. An Industrial Application of the 2-Dimensional Finite Bin Packing Problem.

Degree: MS, Operations Research, 2003, North Carolina State University

 The 2-Dimensional Finite Bin Packing Problem is a NP hard problem with it being observed in many of the process industries like woodcutting, textile manufacturing… (more)

Subjects/Keywords: k-way graph partitioning; bin packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nagarajan, R. P. (2003). An Industrial Application of the 2-Dimensional Finite Bin Packing Problem. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/690

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nagarajan, Rajesh P. “An Industrial Application of the 2-Dimensional Finite Bin Packing Problem.” 2003. Thesis, North Carolina State University. Accessed October 31, 2020. http://www.lib.ncsu.edu/resolver/1840.16/690.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nagarajan, Rajesh P. “An Industrial Application of the 2-Dimensional Finite Bin Packing Problem.” 2003. Web. 31 Oct 2020.

Vancouver:

Nagarajan RP. An Industrial Application of the 2-Dimensional Finite Bin Packing Problem. [Internet] [Thesis]. North Carolina State University; 2003. [cited 2020 Oct 31]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/690.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nagarajan RP. An Industrial Application of the 2-Dimensional Finite Bin Packing Problem. [Thesis]. North Carolina State University; 2003. Available from: http://www.lib.ncsu.edu/resolver/1840.16/690

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Wayne State University

28. Rampersaud, Safraz. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments.

Degree: PhD, Computer Science, 2016, Wayne State University

  Virtualization technologies in cloud computing are ubiquitous throughout data centers around the world where providers consider operational costs and fast delivery guarantees for a… (more)

Subjects/Keywords: approximation algorithms; multilinear programming; sharing-aware; vector bin-packing; vector knapsack; virtualization; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rampersaud, S. (2016). Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. (Doctoral Dissertation). Wayne State University. Retrieved from https://digitalcommons.wayne.edu/oa_dissertations/1477

Chicago Manual of Style (16th Edition):

Rampersaud, Safraz. “Sharing-Aware Resource Management Algorithms For Virtual Computing Environments.” 2016. Doctoral Dissertation, Wayne State University. Accessed October 31, 2020. https://digitalcommons.wayne.edu/oa_dissertations/1477.

MLA Handbook (7th Edition):

Rampersaud, Safraz. “Sharing-Aware Resource Management Algorithms For Virtual Computing Environments.” 2016. Web. 31 Oct 2020.

Vancouver:

Rampersaud S. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. [Internet] [Doctoral dissertation]. Wayne State University; 2016. [cited 2020 Oct 31]. Available from: https://digitalcommons.wayne.edu/oa_dissertations/1477.

Council of Science Editors:

Rampersaud S. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. [Doctoral Dissertation]. Wayne State University; 2016. Available from: https://digitalcommons.wayne.edu/oa_dissertations/1477


Université de Bordeaux I

29. Larchevêque, Hubert. Agrégation de ressources avec contrainte de distance : applications aux plateformes de grande échelle : Resource clustering with distance constraint : applications to large scale platforms.

Degree: Docteur es, Informatique, 2010, Université de Bordeaux I

Durant cette thèse, nous avons introduit les problèmes de Bin Covering avec Contrainte de Distance (BCCD) et de Bin Packing avec Contrainte de Distance (BPCD),… (more)

Subjects/Keywords: Bin packing; Bin covering; Augmentation de ressources; Algorithme d'approximation; Réseaux de grande échelle; Algorithme distribué; Plongement d'Internet; Bin Packing; Bin covering; Resource augmentation,; Distributed algorithms; Probabilistic data structures; Large scale networks; Embedding of the Internet

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Larchevêque, H. (2010). Agrégation de ressources avec contrainte de distance : applications aux plateformes de grande échelle : Resource clustering with distance constraint : applications to large scale platforms. (Doctoral Dissertation). Université de Bordeaux I. Retrieved from http://www.theses.fr/2010BOR14067

Chicago Manual of Style (16th Edition):

Larchevêque, Hubert. “Agrégation de ressources avec contrainte de distance : applications aux plateformes de grande échelle : Resource clustering with distance constraint : applications to large scale platforms.” 2010. Doctoral Dissertation, Université de Bordeaux I. Accessed October 31, 2020. http://www.theses.fr/2010BOR14067.

MLA Handbook (7th Edition):

Larchevêque, Hubert. “Agrégation de ressources avec contrainte de distance : applications aux plateformes de grande échelle : Resource clustering with distance constraint : applications to large scale platforms.” 2010. Web. 31 Oct 2020.

Vancouver:

Larchevêque H. Agrégation de ressources avec contrainte de distance : applications aux plateformes de grande échelle : Resource clustering with distance constraint : applications to large scale platforms. [Internet] [Doctoral dissertation]. Université de Bordeaux I; 2010. [cited 2020 Oct 31]. Available from: http://www.theses.fr/2010BOR14067.

Council of Science Editors:

Larchevêque H. Agrégation de ressources avec contrainte de distance : applications aux plateformes de grande échelle : Resource clustering with distance constraint : applications to large scale platforms. [Doctoral Dissertation]. Université de Bordeaux I; 2010. Available from: http://www.theses.fr/2010BOR14067


Kaunas University of Technology

30. Milevičius, Vilimantas. Dėžių pakavimo su papildomu apribojimu optimizavimo algoritmo sudarymas ir tyrimas.

Degree: Master, Informatics, 2007, Kaunas University of Technology

Šio darbo tikslas – sukurti trimačių dėžių su papildomu orientacijos erdvėje apribojimu pakavimo optimizavimo algoritmą, o realizavus jį programinėmis priemonėmis – ištirti jo efektyvumą su… (more)

Subjects/Keywords: Trimačių dėžių pakavimas; Optimizavimas; Ortogonalusis pakavimas; 3D bin packing; Orthogonal packing; Packing optimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Milevičius, Vilimantas. (2007). Dėžių pakavimo su papildomu apribojimu optimizavimo algoritmo sudarymas ir tyrimas. (Masters Thesis). Kaunas University of Technology. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2007~D_20070816_144408-66957 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Milevičius, Vilimantas. “Dėžių pakavimo su papildomu apribojimu optimizavimo algoritmo sudarymas ir tyrimas.” 2007. Masters Thesis, Kaunas University of Technology. Accessed October 31, 2020. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2007~D_20070816_144408-66957 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Milevičius, Vilimantas. “Dėžių pakavimo su papildomu apribojimu optimizavimo algoritmo sudarymas ir tyrimas.” 2007. Web. 31 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Milevičius, Vilimantas. Dėžių pakavimo su papildomu apribojimu optimizavimo algoritmo sudarymas ir tyrimas. [Internet] [Masters thesis]. Kaunas University of Technology; 2007. [cited 2020 Oct 31]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2007~D_20070816_144408-66957 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Milevičius, Vilimantas. Dėžių pakavimo su papildomu apribojimu optimizavimo algoritmo sudarymas ir tyrimas. [Masters Thesis]. Kaunas University of Technology; 2007. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2007~D_20070816_144408-66957 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

[1] [2]

.