An algorithm for the two-dimensional assortment problem-Reference-Cited by-同舟云学术

An algorithm for the two-dimensional assortment problem

Published:1985-02 Issue:2 Volume:19 Page:253-261
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Beasley J.E.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference12 articles.

1. Classification of real cutting stock problems;Abel,1983

2. Beasley, J.E. “An exact two-dimensional non-guillotine cutting tree search procedure”, to appear in Operations Research.

3. The cutting stock problem in the flat glass industry—selection of stock sizes;Chambers;Operational Research Quarterly,1976

4. A new linear programming approach to the cutting stock problem;Dyckhoff;Operations Research,1981

5. A linear programming approach to the cutting-stock problem;Gilmore;Operations Research,1963

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. THE NEED FOR OPTIMIZED PANEL DESIGN IN THE ELECTRONIC ASSEMBLY PROCESS;Proceeding of Flexible Automation and Integrated Manufacturing 1998;2023

2. Waste-Based Management of Steel Reinforcement Cutting in Construction Projects;Journal of Construction Engineering and Management;2021-07

3. BİR OLUKLU MUKAVVA KUTU FABRİKASINDA STANDART BOBİN ENLERİNİN BELİRLENMESİ;Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi;2019-04-30

4. Determining the best shipper sizes for sending products to customers;International Transactions in Operational Research;2014-11-05

5. An integrated algorithm for cutting stock problems in the thin-film transistor liquid crystal display industry;Computers & Industrial Engineering;2013-04