Scheduling inspired models for two-dimensional packing problems

► 1-D concepts for time representation are combined for 2-D packing problems. ► Two MILP models are proposed. ► Hybrid discrete/continuous-space model better than its discrete-space counterpart. ► Both need search algorithms for efficiently finding the global optimum. ► Iterative procedure for hybri...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 215; H. 1; S. 45 - 56
Hauptverfasser: Castro, Pedro M., Oliveira, José F.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 16.11.2011
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:European Journal of Operational Research
Schlagworte:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Integer programming
Linear programming
Mathematical models
Mathematical problems
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization
Optimization algorithms
Optimization Integer programming Strip packing Resource-Task Network Spatial grids
Packing problem
Rectangles
Representations
Resource-Task Network
Scheduling
Scheduling algorithms
Scheduling, sequencing
Spatial grids
Strategy
Strip
Strip packing
Studies
Two dimensional
Integer programming
Spatial grids
Resource-Task Network
Strip packing
Optimization
Search strategy
Task scheduling
Bin packing problem
Mixed integer programming
Scheduling
Modeling
Linear model
Height
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:► 1-D concepts for time representation are combined for 2-D packing problems. ► Two MILP models are proposed. ► Hybrid discrete/continuous-space model better than its discrete-space counterpart. ► Both need search algorithms for efficiently finding the global optimum. ► Iterative procedure for hybrid model is over the number of events of the y-axis grid. We propose two exact algorithms for two-dimensional orthogonal packing problems whose main components are simple mixed-integer linear programming models. Based on the different forms of time representation in scheduling formulations, we extend the concept of multiple time grids into a second dimension and propose a hybrid discrete/continuous-space formulation. By relying on events to continuously locate the rectangles along the strip height, we aim to reduce the size of the resulting mathematical problem when compared to a pure discrete-space model, with hopes of achieving a better computational performance. Through the solution of a set of 29 test instances from the literature, we show that this was mostly accomplished, primarily because the associated search strategy can quickly find good feasible solutions prior to the optimum, which may be very important in real industrial environments. We also provide a comprehensive comparison to seven other conceptually different approaches that have solved the same strip packing problems.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2011.06.001