[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Bekrar et al., 2009 - Google Patents

An exact method for the 2D guillotine strip packing problem

Bekrar et al., 2009

View PDF @Full View
Document ID
11998846032530410840
Author
Bekrar A
Kacem I
Publication year
Publication venue
Advances in Operations Research

External Links

Snippet

We consider the two‐dimensional strip packing problem with guillotine cuts. The problem consists in packing a set of rectangular items on one strip of width W and infinite height. The items packed without overlapping must be extracted by a series of cuts that go from one …
Continue reading at onlinelibrary.wiley.com (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0631—Resource planning, allocation or scheduling for a business operation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading, distribution or shipping; Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation, e.g. computer aided management of electronic mail or groupware; Time management, e.g. calendars, reminders, meetings or time accounting
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce, e.g. shopping or e-commerce
    • G06Q30/02—Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity

Similar Documents

Publication Publication Date Title
Fanjul-Peyro et al. Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
Ferone et al. A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
Andrade et al. Two‐stage two‐dimensional guillotine cutting stock problems with usable leftover
Oliveira et al. A survey on heuristics for the two-dimensional rectangular strip packing problem
Delorme et al. Logic based Benders' decomposition for orthogonal stock cutting problems
Wei et al. A skyline heuristic for the 2D rectangular packing and strip packing problems
Crainic et al. TS2PACK: A two-level tabu search for the three-dimensional bin packing problem
Ko et al. A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs
Dolatabadi et al. Exact algorithms for the two-dimensional guillotine knapsack
Zeng et al. A Hybrid GRASP+ VND Heuristic for the Two‐Echelon Vehicle Routing Problem Arising in City Logistics
Moslehi et al. Optimizing blocking flow shop scheduling problem with total completion time criterion
Alemany et al. Symmetry issues in mixed integer programming based Unit Commitment
Martin et al. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
Birgin et al. Generating unconstrained two-dimensional non-guillotine cutting patterns by a recursive partitioning algorithm
Mahvash et al. A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints
Qin et al. Combined simulated annealing algorithm for the discrete facility location problem
Bilal et al. A new formulation of the set covering problem for metaheuristic approaches
Toth Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Bortfeldt A reduction approach for solving the rectangle packing area minimization problem
Bekrar et al. An exact method for the 2D guillotine strip packing problem
Alenezy Solving capacitated facility location problem using lagrangian decomposition and volume algorithm
Xu An efficient heuristic approach for irregular cutting stock problem in ship building industry
Kheirkhah et al. A three-phase heuristic approach to solve an integrated cell formation and production planning problem
Vasilyev et al. Fast heuristic algorithms for the multiple strip packing problem
do Nascimento et al. A MIP-CP based approach for two-and three-dimensional cutting problems with staged guillotine cuts