5 resultados para cutting stock problem with setups
em Cochin University of Science
Resumo:
Machine tool chatter is an unfavorable phenomenon during metal cutting, which results in heavy vibration of cutting tool. With increase in depth of cut, the cutting regime changes from chatter-free cutting to one with chatter. In this paper, we propose the use of permutation entropy (PE), a conceptually simple and computationally fast measurement to detect the onset of chatter from the time series using sound signal recorded with a unidirectional microphone. PE can efficiently distinguish the regular and complex nature of any signal and extract information about the dynamics of the process by indicating sudden change in its value. Under situations where the data sets are huge and there is no time for preprocessing and fine-tuning, PE can effectively detect dynamical changes of the system. This makes PE an ideal choice for online detection of chatter, which is not possible with other conventional nonlinear methods. In the present study, the variation of PE under two cutting conditions is analyzed. Abrupt variation in the value of PE with increase in depth of cut indicates the onset of chatter vibrations. The results are verified using frequency spectra of the signals and the nonlinear measure, normalized coarse-grained information rate (NCIR).
Resumo:
With the increase in population, housing and construction of various facilities have been a problem with urbanization. Having exhausted all the trouble free hand, man is nowon the lookout for techniques to improve areas which were originally considered uninhabitable. Thus this study is based on the nature and engineering behavior of soft clays covering long stretches of coastal line and methods to improve their geotechnical properties .The main aim of the present investigation is to study in detail the physical and engineering behavior of the marine clays of Cochin. While it is well known that the marine clays have been posing numerous problems to foundation engineers all along, the relevant literature reveals that no systematic and comprehensive study has been attempted to date. The: knowledge gained through the study is suitably used to improve these properties with appropriate additives.
Resumo:
An attempt has been made in this study to screen some fish muscle enzymes to assess their potential worth in testing the degree of freshness of fish. A problem with routine enzyme activity determinations is the complexity of the method of enzyme assay. Hence, in the present study as far as possible simple assay techniques were adopted. Several species were screened to assess the possibility of employing this procedure on a large scale. It is hoped that findings of this study will lead to the development of meaningful criteria in testing the freshness of fish. This thesis has been divided into five chapters
Resumo:
Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of complex structured products. The problem becomes even more complicated if a combination of two or more optimization criteria is considered. This thesis addresses an assembly job shop scheduling problem with multiple objectives. The objectives considered are to simultaneously minimizing makespan and total tardiness. In this thesis, two approaches viz., weighted approach and Pareto approach are used for solving the problem. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Two metaheuristic techniques namely, genetic algorithm and tabu search are investigated in this thesis for solving the multiobjective assembly job shop scheduling problems. Three algorithms based on the two metaheuristic techniques for weighted approach and Pareto approach are proposed for the multi-objective assembly job shop scheduling problem (MOAJSP). A new pairing mechanism is developed for crossover operation in genetic algorithm which leads to improved solutions and faster convergence. The performances of the proposed algorithms are evaluated through a set of test problems and the results are reported. The results reveal that the proposed algorithms based on weighted approach are feasible and effective for solving MOAJSP instances according to the weight assigned to each objective criterion and the proposed algorithms based on Pareto approach are capable of producing a number of good Pareto optimal scheduling plans for MOAJSP instances.
Resumo:
Department of Applied Economics,Cochin University of Science and Technology