In this paper we study the two-dimensional non-guillotine cutting problem, the problem of cutting rectangular pieces from a large stock rectangle so as to maximize the total value of the pieces cut. The problem has many industrial applications whenever small pieces have to be cut from or packed into a large stock sheet. We propose a tabu search algorithm. Several moves based on reducing and ins...

An experimental study has been performed to investigate the capabilities of dry, conventional and high pressure jet assisted turning of two different hard-to-machine materials, namely hard-chromed and surface hardened Ck45 and Inconel 718. The capabilities of different hard turning procedures are compared by means of chip breakability, technological windows, cooling lubrication efficiency, and ...

Database system is mainly created for superhard cutting. In the paper, the processing time is considered as the objective function based on the issue needs, the establishing of the mathematical model of the cutting database system mainly takes cutting force, power tools, precision machining and tool life as constraints. And the database develops through the development software VS2008 and SQL S...

We develop the rst explicit procedures for exact envy-free chore division for 4 or more players. We also give a simple 3-person procedure. Our 4-person moving-knife scheme and n-person discrete algorithm are accomplished by exploiting a notion of \irrevocable advantage" for chores, and are motivated by similar solutions for cake-cutting by Brams, Taylor, and Zwicker. We discuss the diierences b...