scholarly journals Node-Packing Problems with Integer Rounding Properties

1989 ◽  
Vol 2 (3) ◽  
pp. 407-412 ◽  
Author(s):  
S. K. Tipnis ◽  
L. E. Trotter, Jr.
Keyword(s):  
Packing Problems ◽  
Node Packing ◽  
Integer Rounding

scholarly journals Empowering the configuration-IP: new PTAS results for scheduling with setup times

2021 ◽  
Author(s):  
Klaus Jansen ◽  
Kim-Manuel Klein ◽  
Marten Maack ◽  
Malin Rau
Keyword(s):  
Approximation Scheme ◽  
Constant Factor ◽  
Setup Times ◽  
Linear Programs ◽  
Scheduling Problems ◽  
Design Of Algorithms ◽  
Packing Problems ◽  
Integer Linear Programs ◽  
One Machine ◽  
Target Locations

AbstractInteger linear programs of configurations, or configuration IPs, are a classical tool in the design of algorithms for scheduling and packing problems where a set of items has to be placed in multiple target locations. Herein, a configuration describes a possible placement on one of the target locations, and the IP is used to choose suitable configurations covering the items. We give an augmented IP formulation, which we call the module configuration IP. It can be described within the framework of n-fold integer programming and, therefore, be solved efficiently. As an application, we consider scheduling problems with setup times in which a set of jobs has to be scheduled on a set of identical machines with the objective of minimizing the makespan. For instance, we investigate the case that jobs can be split and scheduled on multiple machines. However, before a part of a job can be processed, an uninterrupted setup depending on the job has to be paid. For both of the variants that jobs can be executed in parallel or not, we obtain an efficient polynomial time approximation scheme (EPTAS) of running time $$f(1/\varepsilon )\cdot \mathrm {poly}(|I|)$$ f ( 1 / ε ) · poly ( | I | ) . Previously, only constant factor approximations of 5/3 and $$4/3 + \varepsilon $$ 4 / 3 + ε , respectively, were known. Furthermore, we present an EPTAS for a problem where classes of (non-splittable) jobs are given, and a setup has to be paid for each class of jobs being executed on one machine.

Packing Optimization by Enhanced Rubber Band Analogy

2005 ◽  
Author(s):  
Hong Dong ◽  
Georges M. Fadel ◽  
Vincent Y. Blouin
Keyword(s):  
Three Dimensional ◽  
Optimization Method ◽  
Rubber Band ◽  
Volume Relaxation ◽  
New Developments ◽  
Packing Problems ◽  
Rubber Balloon ◽  
Elastic Forces ◽  
Reaction Forces ◽  
Packing Optimization

In this paper, some new developments to the packing optimization method based on the rubber band analogy are presented. This method solves packing problems by simulating the physical movements of a set of objects wrapped by a rubber band in the case of two-dimensional problems or by a rubber balloon in the case of three-dimensional problems. The objects are subjected to elastic forces applied by the rubber band to their vertices as well as reaction forces when contacts between objects occur. Based on these forces, objects translate or rotate until maximum compactness is reached. To improve the compactness further, the method is enhanced by adding two new operators: volume relaxation and temporary retraction. These two operators allow temporary volume (elastic energy) increase to get potentially better packing results. The method is implemented and applied for three-dimensional arbitrary shape objects.

scholarly journals Bin Packing Problems with Uncertainty on Item Characteristics: An Application to Capacity Planning in Logistics

2014 ◽  
Vol 111 ◽  
pp. 654-662 ◽  
Author(s):  
Teodor Gabriel Crainic ◽  
Luca Gobbato ◽  
Guido Perboli ◽  
Walter Rei ◽  
Jean-Paul Watson ◽  
...  
Keyword(s):  
Capacity Planning ◽  
Bin Packing ◽  
Packing Problems ◽  
Item Characteristics

scholarly journals Generalized Bin Packing Problems

4OR ◽  
2013 ◽  
Vol 12 (3) ◽  
pp. 293-294 ◽  
Author(s):  
Mauro Maria Baldi
Keyword(s):  
Bin Packing ◽  
Packing Problems
Sign in / Sign up

Export Citation Format

Share Document