A flexible labour division approach to the polygon packing problem based on space allocation
Published 2016 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A flexible labour division approach to the polygon packing problem based on space allocation
Authors
Keywords
-
Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 55, Issue 11, Pages 3025-3045
Publisher
Informa UK Limited
Online
2016-09-01
DOI
10.1080/00207543.2016.1229070
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Robust mixed-integer linear programming models for the irregular strip packing problem
- (2016) Luiz H. Cherri et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Unknown
- (2016) INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS
- Unknown
- (2016) International Transactions in Operational Research
- Irregular packing: MILP model based on a polygonal enclosure
- (2015) Miguel Cezar Santoro et al. ANNALS OF OPERATIONS RESEARCH
- A random-key genetic algorithm for solving the nesting problem
- (2015) Plácido R. Pinheiro et al. INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING
- A pairwise exact placement algorithm for the irregular nesting problem
- (2015) André Kubagawa Sato et al. INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING
- A semi-continuous MIP model for the irregular strip packing problem
- (2015) Aline A.S. Leao et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Crowdsourcing solutions to 2D irregular strip packing problems from Internet workers
- (2015) Gokula Vijaykumar Annamalai Vasantha et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- An effective heuristic for the two-dimensional irregular bin packing problem
- (2013) Eunice López-Camacho et al. ANNALS OF OPERATIONS RESEARCH
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- (2013) Ahmed Elkeran EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An emergent computation approach to the problem of polygon layout with performance constraints
- (2013) Zhendong Huang et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- MODELING AND SIMULATION OF ANT COLONY'S LABOR DIVISION WITH CONSTRAINTS FOR TASK ALLOCATION OF RESILIENT SUPPLY CHAINS
- (2012) RENBIN XIAO et al. International Journal on Artificial Intelligence Tools
- Modeling of Ant Colony's Labor Division for the Multi-Project Scheduling Problem and Its Solution by PSO
- (2012) Renbin Xiao et al. Journal of Computational and Theoretical Nanoscience
- Response threshold models and stochastic learning automata for self-coordination of heterogeneous multi-task distribution in multi-robot systems
- (2012) Javier de Lope et al. ROBOTICS AND AUTONOMOUS SYSTEMS
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- (2011) Stephen C.H. Leung et al. COMPUTERS & OPERATIONS RESEARCH
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- (2009) Takashi Imamichi et al. Discrete Optimization
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- (2009) W.K. Wong et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- A tutorial in irregular shape packing problems
- (2009) J A Bennell et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- A heuristic for nesting problems of irregular shapes
- (2008) Wen-Chen Lee et al. COMPUTER-AIDED DESIGN
- A beam search implementation for the irregular shape packing problem
- (2008) Julia A. Bennell et al. JOURNAL OF HEURISTICS
- The geometry of nesting problems: A tutorial
- (2007) Julia A. Bennell et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now