نتایج جستجو برای: cutting stock problem
تعداد نتایج: 995311 فیلتر نتایج به سال:
We develop a Logic in which the basic objects of concern are games, or equivalently, monotone predicate transforms. We give completeness and decision results and extend to certain kinds of many-person games. Applications to a cake cutting algorithm and to a protocol for exchanging secrets, are given.
The no"t polygon is a powerful and e!ective tool for handling the geometry required for a range of solution approaches to two-dimensional irregular cutting-stock problems. However, unless all the pieces are convex, it is widely perceived as being di$cult to implement, and its use has therefore been somewhat limited. The primary purpose of this paper is to correct this misconception by introduci...
In this work we consider a one-dimentional cutting stock problem in which the non-used material in the cutting patterns may be used in the future, if large enough. This feature introduces difficulties in comparing solutions of the cutting problem, for example, up to what extent a minimum leftover solution is the most interesting one when the leftover may be used? Some desirable characteristics ...
— Chinese enterprises have become extensively linked with the global economy, yet in a shallow manner. They remain stuck in commodity manufacturing, undifferentiated activities for which innovation is absent. Competition then revolves around cutthroat cost cutting. This outcome stems from three factors. First, it reflects the new challenges to development posed by globally networked production....
In this paper, an integer programming model for two-dimensional cutting stock problems is proposed. In the problems addressed, it is intended to cut a set of small rectangular items of given sizes from a set of larger rectangular plates in such a way that the total number of used plates is minimized. The two-stage and three-stage, exact and non-exact, problems are considered. Other issues are a...
Experimental results from a statistical analysis algorithm for objectively comparing toolmarks via data files obtained using optical profilometry data are described. The algorithm employed has successfully been used to compare striated marks produced by screwdrivers. In this study, quasi-striated marks produced by the cutting surfaces of slip-joint pliers were examined. Marks were made by cutti...
The present status of lattice calculations of fD, fB and some mass splittings are discussed. When one includes the uncertainties due to discretization errors, the results do not yet have a suucient precision to be relevant to phenomenological applications. There are, however, good prospects of cutting down the uncertainties by a factor of 2 or more soon.
Problems in operations research are often NP complete and optimal solution for larger problems cannot be obtained, therefore heuristic methods have to be used. The boundary between the size of the problem that can be solved optimally and those where heuristic methods should be used is not always clear. To solve this problem we propose a method based on decision trees. The method can be also use...
In the production process for wooden furniture, raw material costs account more than 50% of furniture costs, and utilization rate materials depends mainly on layout scheme. Therefore, a reasonable is an important measure to reduce costs. This paper investigates solid wood board cutting stock problem (CSP) establishes optimization model, with goal highest possible original boards. An ant colony-...
We study the monotonicity properties of solutions in the classic problem of fair cake-cutting — dividing a heterogeneous resource among agents with different preferences. Resourceand population-monotonicity relate to scenarios where the cake, or the number of participants who divide the cake, changes. It is required that the utility of all participants change in the same direction: either all o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید