Following the work of Anily et al., we consider a variant of bin packing, called BIN PACKING WITH GENERAL COST STRUCTURES (GCBP) and design an asymptotic fully polynomial time approximation scheme (AFPTAS) for this problem. In the classic bin packing problem, a set of one-dimensional items is to be assigned to subsets of total size at most 1, that is, to be packed into unit sized bins. However,...

2 West Central Research and Outreach Center, University of Minnesota, Morris; 3 Iowa State University, Ames, 4 Minnesota Extension Regional Office, Mankato; 5 Department of Animal Science, University of Minnesota, St. Paul II. Abstract: Two experiments were conducted to evaluate the effects of feed bin design and the use of passive agitators on flowability of feed containing 40% dried distiller...

4 Giles, J. (2007) PR’s ‘pit bull’ takes on open access. Nature 347, 445 5 Lexchin, J. and Light, D.W. (2006) Commercial influence and the content of medical journals. BMJ 332, 1444–1447 6 UK House of Commons, Science and Technology Committee (2011) Peer Review in Scientific Publications. Eighth Report of Session 2010–1, The Stationery Office 7 Smith, R. (2006) Peer review: a flawed process at ...

Background: Bin packing is an NP hard optimization problem of packing items of given sizes into minimum number of capacity limited bins. Besides the basic problem, numerous other variants of bin packing exist. The cardinality constrained bin packing adds an additional constraint that the number of items in a bin must not exceed a given limit Nmax. Objectives: Goal of the paper is to present a p...

Using the price for recycling used home appliances as a variable in the decision-making process, this paper studies the pricing decision-making process of the home appliances enterprises when a wholesale and retail price for the green home appliances have already been determined by other methods. In consideration of the influences of the effective recycle behavior of the used home appliances to...

case performance bounds for simple one-dimensional packing algorithms. SIAM J. A better algorithm for an ancient scheduling problem. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. A new algorithm for on-line bin-packing. 44 43] G. Galambos and J. B. G. Frenk. A simple proof of Liang's lower bound for on-line bin packing and the extension to the ...

Thermoplastic composite materials have become indispensable for the aerospace industry due to their processing and recycling potentials. The use of recyclable thermoplastic composites in manufacturing, offers a solution waste. It is fact that lot waste convenient emerge every year. In this study, advantages being suitable benefits as management terms environment, economy energy were evaluated. ...