Author
Floyd E. Wolf
Other affiliations: Kutztown University of Pennsylvania
Bio: Floyd E. Wolf is an academic researcher from Bethlehem Steel. The author has contributed to research in topics: Cutting stock problem & Ingot. The author has an hindex of 10, co-authored 18 publications receiving 300 citations. Previous affiliations of Floyd E. Wolf include Kutztown University of Pennsylvania.
Papers
More filters
TL;DR: A two-phase, computer-based procedure for selecting optimal ingot and internal ingot mold dimensions consistent with both the new stripper's capability and with mill constraints is developed.
Abstract: In 1984, Bethlehem Steel Corporation installed a new ingot mold stripping facility at its Bethlehem Plant that is capable of handling taller ingots. In order to take maximum advantage of this new facility, we developed a two-phase, computer-based procedure for selecting optimal ingot and internal ingot mold dimensions. Phase I of this procedure generates feasible ingot and internal ingot mold dimensions consistent with both the new stripper's capability and with mill constraints. Phase II then uses a set covering approach to select the optimal ingot and internal ingot mold sizes from among the feasible sizes generated. After analyzing the model, we recommended six new rectangular mold sizes to replace seven existing sizes. To date, implementation of these new ingot and mold sizes is proceeding smoothly and realizing the projected cost reduction benefits.
84 citations
TL;DR: The PPC module responsible for assigning metallurgical grades to customer orders uses a minimum cardinality set covering approach which not only minimizes the number of metallurgy grades required to satisfy a given collection of customer orders, but also is able to ‘show preference’ to priority orders.
47 citations
TL;DR: In this article, a fuzzy formulation of the two-dimensional cutting stock problem is presented, where α-cut sets are generated from the fuzzy formulation and a heuristic approach is developed to efficiently solve this sequence of problems.
30 citations
TL;DR: A new heuristic and several existing heuristics written in FORTRAN are used to solve 31 large SCPs on an IBM PC/AT, with the result that the old heuristic, SCAMP, performed the best.
21 citations
TL;DR: This paper demonstrates how the expertise of the metallurgist can be used to define fuzzy subsets of the set of all metallurgical grades such that the membership function is based on the likelihood of a grade meeting the customer's specifications.
18 citations
Cited by
More filters
TL;DR: In this article, the authors present a review of the state-of-the-art in continuous location models and network location models, mixed-integer programming models, and applications for distribution system design.
935 citations
TL;DR: The many facets of this exciting and centrally placed field of facility siting are reviewed through reference to both seminal works and current reviews.
674 citations
TL;DR: A new heuristic algorithm for each problem in the class of problems arising from all combinations of the above requirements, and a unified tabu search approach that is adapted to a specific problem by simply changing the heuristic used to explore the neighborhood.
Abstract: Two-dimensional bin packing problems consist of allocating, without overlapping, a given set of small rectangles (items) to a minimum number of large identical rectangles (bins), with the edges of the items parallel to those of the bins. According to the specific application, the items may either have a fixed orientation or they can be rotated by 90°. In addition, it may or not be imposed that the items are obtained through a sequence of edge-to-edge cuts parallel to the edges of the bin. In this article, we consider the class of problems arising from all combinations of the above requirements. We introduce a new heuristic algorithm for each problem in the class, and a unified tabu search approach that is adapted to a specific problem by simply changing the heuristic used to explore the neighborhood. The average performance of the single heuristics and of the tabu search are evaluated through extensive computational experiments.
353 citations
TL;DR: This work surveys recent advances obtained for the two-dimensional bin packing problem, with special emphasis on exact algorithms and effective heuristic and metaheuristic approaches.
307 citations