Establishing the optimality of sequencing heuristics for cutting stock problems-Reference-Cited by-同舟云学术

Establishing the optimality of sequencing heuristics for cutting stock problems

Published:1995-08 Issue:3 Volume:84 Page:590-598
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Yuen Boon J.,Richardson Ken V.

Publisher

Elsevier BV

Subject

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

Reference10 articles.

1. The Cutting Stock Problem in the flat glass industry;Dyson;Operations Research Quarterly,1974

2. Cutting pattern and cutter schedules;Johnston;ASOR Bulletin,1984

3. Glass cutting in a small firm;Madsen;Mathematical Programming,1979

4. A cutting sequencing algorithm;Madsen,1980

5. An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry;Madsen;Journal of the Operational Research Society,1988

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

1. Mathematical models for the minimization of open stacks problem;International Transactions in Operational Research;2021-09-02

2. Integer Linear Programming Model and Algorithm to Integrate Heuristics Scheduling EDD, Inventory Control and Distribution Problems in a Modular Production System;IOP Conference Series: Materials Science and Engineering;2019-05-01

3. Two-dimensional cutting stock problem with sequence dependent setup times;European Journal of Operational Research;2018-02

4. Descent search approaches applied to the minimization of open stacks;Computers & Industrial Engineering;2017-10

5. What do Constraint Programming Users Want to See? Exploring the Role of Visualisation in Profiling of Models and Search;IEEE Transactions on Visualization and Computer Graphics;2017-01