jain leena (15 risultati)

Paperback. Condizione: New.

Paperback. Condizione: New.

Paperback. Condizione: New.

Paperback. Condizione: New.

Taschenbuch. Condizione: Neu. A Heuristic Based Solution for Rectangle Packing Problem | An Analysis and Design of Heuristic Approach | Leena Jain (u. a.) | Taschenbuch | 296 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846538425 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.

Paperback. Condizione: Brand New. 296 pages. 8.66x5.91x0.67 inches. In Stock.

paperback. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Hardcover. Condizione: Brand New. gld edition. 685 pages. 9.30x6.30x1.40 inches. In Stock.

PAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This monograph investigates approaches for two-dimensional stock cutting (Rectangle Packing) problems and development of a new algorithm which brings back the revision of a classical heuristic for Rectangle Packing as proposed by Cheok and Nee. These problems occur in several important manufacturing industries e.g. Paper, Glass, Wood, Textile, Plastic and Foam, Garments, Leather, Ship manufacturing and Shoe making etc. The application of automatic packing algorithms can yield considerable cost savings through the diminution of human solvers and better utilisation of raw material.The scope of the research study is to develop an algorithm for a heuristic that aims for optimisation of a rectangle packing problem (RPP). An instance of RPP can be described as number of rectangles called items (comparatively smaller in size) that are to be packed/ cut from relatively larger rectangles called objects, in such a way that the scrap left is minimum or sheet utilisation is maximum. These objects can even be a stock of different sized rectangles available in assorted numbers. This monograph has 6 chapters and provides adequate material on various approaches to solve the RPP. 296 pp. Englisch.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Jain ManishDr. Manish Jain has done his graduation from Darshan Dental College & Hospital, RUHS University Udaipur with an exceptional academic records. He did master in dental surgery in the specialty of Public health dentistry from.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Jain LeenaDr. Leena Jain is Assistant Professor in RIMT Mandi Gobindgarh, Punjab,India. She has seven years of experience in the academic field and has twenty Research Papers.Dr. Kawaljeet Singh is working as Director, University Co.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This monograph investigates approaches for two-dimensional stock cutting (Rectangle Packing) problems and development of a new algorithm which brings back the revision of a classical heuristic for Rectangle Packing as proposed by Cheok and Nee. These problems occur in several important manufacturing industries e.g. Paper, Glass, Wood, Textile, Plastic and Foam, Garments, Leather, Ship manufacturing and Shoe making etc. The application of automatic packing algorithms can yield considerable cost savings through the diminution of human 'solvers' and better utilisation of raw material.The scope of the research study is to develop an algorithm for a heuristic that aims for optimisation of a rectangle packing problem (RPP). An instance of RPP can be described as number of rectangles called items (comparatively smaller in size) that are to be packed/ cut from relatively larger rectangles called objects, in such a way that the scrap left is minimum or sheet utilisation is maximum. These objects can even be a stock of different sized rectangles available in assorted numbers. This monograph has 6 chapters and provides adequate material on various approaches to solve the RPP.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 296 pp. Englisch.

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This monograph investigates approaches for two-dimensional stock cutting (Rectangle Packing) problems and development of a new algorithm which brings back the revision of a classical heuristic for Rectangle Packing as proposed by Cheok and Nee. These problems occur in several important manufacturing industries e.g. Paper, Glass, Wood, Textile, Plastic and Foam, Garments, Leather, Ship manufacturing and Shoe making etc. The application of automatic packing algorithms can yield considerable cost savings through the diminution of human solvers and better utilisation of raw material.The scope of the research study is to develop an algorithm for a heuristic that aims for optimisation of a rectangle packing problem (RPP). An instance of RPP can be described as number of rectangles called items (comparatively smaller in size) that are to be packed/ cut from relatively larger rectangles called objects, in such a way that the scrap left is minimum or sheet utilisation is maximum. These objects can even be a stock of different sized rectangles available in assorted numbers. This monograph has 6 chapters and provides adequate material on various approaches to solve the RPP.