In any CAPP system, one of the most important process planning functions is selection of the operations and corresponding machines in order to generate the optimal operation sequence. In this paper, the hybrid GA-SA algorithm is used to solve this combinatorial optimization NP (Non-deterministic Polynomial) problem. The network representation is adopted to describe operation and sequencing flexibility in process planning and the mathematical model for process planning is described with the objective of minimizing the production time. Experimental results show effectiveness of the hybrid algorithm that, in comparison with the GA and SA standalone algorithms, gives optimal operation sequence with lesser computational time and lesser number of...
This study addresses process sequencing subject to precedence constraints which arises as a sub-prob...
Computer aided processes planning (CAPP) is an important interface between Computer Aided Design (CA...
Assembly Sequence Planning (ASP) is known as a large-scale, timeconsuming combinatorial problem. The...
Computer-aided process planning represents the main link between computer-aided design and computer-...
This thesis addresses process sequencing subject to precedence constraints which arises as a subprob...
Process sequencing is considered as the key technology for computer aided process planning (CAPP) an...
As globalization has increased in the past few years, many companies attempts to made appropriate st...
U ovom članku predstavljen je koncept za optimalno planiranje serijske proizvodnje uporabom genetsko...
Automated Process Planning forms an important link in CIM Systems. Process Sequencing is one of the ...
[EN] The Buffer Allocation Problem (BAP) is a problem of combinatorial NP-Hard optimization in the d...
Ovaj rad predstavlja hibridni genetski algoritam za problem programiranja kod montaže na tekućoj tra...
Atölye çizelgeleme problemi üretim planlamanın önemli aşamalarından birisidir. Ancak üretim planlama...
Projektiranje tehnoloških procesa (PTP) koristimo da skratimo ukupno vrijeme izrade, smanjimo troško...
Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2005Thesis (M.Sc.) -- ...
Pertaining to the intricacies involved in the formulation of an optimal process planning system, ope...
This study addresses process sequencing subject to precedence constraints which arises as a sub-prob...
Computer aided processes planning (CAPP) is an important interface between Computer Aided Design (CA...
Assembly Sequence Planning (ASP) is known as a large-scale, timeconsuming combinatorial problem. The...
Computer-aided process planning represents the main link between computer-aided design and computer-...
This thesis addresses process sequencing subject to precedence constraints which arises as a subprob...
Process sequencing is considered as the key technology for computer aided process planning (CAPP) an...
As globalization has increased in the past few years, many companies attempts to made appropriate st...
U ovom članku predstavljen je koncept za optimalno planiranje serijske proizvodnje uporabom genetsko...
Automated Process Planning forms an important link in CIM Systems. Process Sequencing is one of the ...
[EN] The Buffer Allocation Problem (BAP) is a problem of combinatorial NP-Hard optimization in the d...
Ovaj rad predstavlja hibridni genetski algoritam za problem programiranja kod montaže na tekućoj tra...
Atölye çizelgeleme problemi üretim planlamanın önemli aşamalarından birisidir. Ancak üretim planlama...
Projektiranje tehnoloških procesa (PTP) koristimo da skratimo ukupno vrijeme izrade, smanjimo troško...
Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2005Thesis (M.Sc.) -- ...
Pertaining to the intricacies involved in the formulation of an optimal process planning system, ope...
This study addresses process sequencing subject to precedence constraints which arises as a sub-prob...
Computer aided processes planning (CAPP) is an important interface between Computer Aided Design (CA...
Assembly Sequence Planning (ASP) is known as a large-scale, timeconsuming combinatorial problem. The...