- Step 4: Determine the Optimum Sequence

2018 ◽  
pp. 74-81
Keyword(s):  
Optimum Sequence

A Nongraphical Method to Determine the Optimum Disassembly Plan in Remanufacturing

2012 ◽  
Vol 135 (2) ◽  
Author(s):  
Niloufar Ghoreishi ◽  
Mark J. Jakiela ◽  
Ali Nekouzadeh
Keyword(s):  
Decision Trees ◽  
Optimization Methods ◽  
Disassembly Process ◽  
Precedence Relations ◽  
Net Profit ◽  
Computer Codes ◽  
Disassembly Plan ◽  
Optimum Sequence

Optimizing a disassembly process involves maximizing the number of disassembled valuable parts (cores) and minimizing the number of disassembly operations. Usually, some disassembly operations are in common among two or more cores, or sometimes removing a core requires prior removal of other cores (known as precedence relations); these correlations complicate the allocation of the disassembly cost to the cores. To overcome this complexity, the current optimization methods (decision trees) determine the optimum sequence of disassembly operations rather than the optimum set of cores to be disassembled. These methods become difficult to implement when the number of cores increases. In this paper, we developed a mechanized nongraphical approach to determine the optimum set of cores to be disassembled and their required disassembly operations based on the functionality statuses of the cores. This approach introduces a new characterization of the disassembly process and its precedence relations, and can be implemented conveniently using computer codes even when the product consists of many cores. The application of the method is explained with an example. Using this example, it was shown that the optimum disassembly can increase the net profit significantly compared with the complete disassembly.

DIVISIBLE LOAD DISTRIBUTION IN A NETWORK OF PROCESSORS

2008 ◽  
Vol 09 (01n02) ◽  
pp. 31-51 ◽  
Author(s):  
SAMEER BATAINEH
Keyword(s):  
Closed Form ◽  
Load Distribution ◽  
Closed Form Solution ◽  
Form Solution ◽  
The Other ◽  
Optimum Number ◽  
Sequencing Problem ◽  
Divisible Load ◽  
Finish Time ◽  
Optimum Sequence

The paper presents a closed form solution for an optimum scheduling of a divisible job on an optimum number of processor arranged in an optimum sequence in a multilevel tree networks. The solution has been derived for a single divisible job where there is no dependency among subtasks and the root processor can either perform communication and computation at the same time. The solution is carried out through three basic theorems. One of the theorems selects the optimum number of available processors that must participate in executing a divisible job. The other solves the sequencing problem in load distribution by which we are able to find the optimum sequence for load distribution in a generalized form. Having the optimum number of processors and their sequencing for load distribution, we have developed a closed form solution that determines the optimum share of each processor in the sequence such that the finish time is minimized. Any alteration of the number of processors, their sequences, or their shares that are determined by the three theorems will increase the finish time.

scholarly journals Improving Project Management Teaching Using Scaffolding Based on Cladistics Parsimony Analysis

2017 ◽  
Vol 11 (5) ◽  
pp. 42
Author(s):  
Stanislaw Paul MAJ
Keyword(s):  
Project Management ◽  
Long Term Memory ◽  
Financial Instruments ◽  
Parsimony Analysis ◽  
Learning Sequence ◽  
Optimal Learning ◽  
Different Characteristics ◽  
Educational Paradigms ◽  
Optimum Sequence

There are numerous educational paradigms each with their advocates and critics. The cognitive science approach is based on modelling memory as short term and long term each with their different characteristics. All learning consists of an iterative cycle of assimilate and retrieve between these two types of memory. The objective is the construction of an ordered mental structure called a schema in long term memory. With this approach it is possible to define schemas according to an optimal learning sequence. An optimum sequence has minimal cognitive load and hence the ideal teaching sequence. Previous work has clearly demonstrated that this method may be applied to network technology education. This paper applies the same method of teaching financial instruments in project management. Results to date demonstrate that scaffolding, based on cladistics parsimony analysis is a generic method and can be applied to different disciplines. Using this method an optimal learning sequence for project management financial instruments may be produced.

scholarly journals C-terminal peptides of rhodopsin. Determination of the optimum sequence for recognition of retinal transducin

1986 ◽  
Vol 235 (1) ◽  
pp. 309-312 ◽  
Author(s):  
D J Takemoto ◽  
D Morrison ◽  
L C Davis ◽  
L J Takemoto
Keyword(s):  
Amino Acid Residues ◽  
Guanine Nucleotide Binding Protein ◽  
Bovine Rhodopsin ◽  
C Terminus ◽  
Retinal Rod ◽  
Gamma Subunits ◽  
Guanine Nucleotide Binding ◽  
A Site ◽  
Optimum Sequence

In vertebrate retinal rod outer segments, transducin, a guanine-nucleotide-binding protein, mediates signal coupling between rhodopsin and cyclic GMP phosphodiesterase. Whereas the T alpha subunit (39 kDa) of transducin binds guanine nucleotides and is the activator of the phosphodiesterase, the T beta gamma subunits (35 and 10 kDa) may function to physically link T alpha with photolysed rhodopsin. We have previously reported that a site of binding of transducin is on the C-terminus of bovine rhodopsin. By using competition with synthetic peptides, the recognition region was localized to bovine opsin amino acid residues 317-339. Further studies are detailed which determine the boundaries of this binding site on rhodopsin, as well as some of the critical amino acids needed for transducin binding. These results suggest that the serine and threonine residues in the rhodopsin C-terminal peptides Rhod-1 and Rhod-3 are critical for reconstitution of transducin GTPase activity.

Re-sequencing of Design Processes With Activity Stochastic Time and Cost: An Optimization-Simulation Approach

2005 ◽  
Vol 129 (2) ◽  
pp. 150-157 ◽  
Author(s):  
Hisham M. E. Abdelsalam ◽  
Han P. Bao
Keyword(s):  
New Product Development ◽  
Design Process ◽  
Life Cycle Cost ◽  
Robust Solution ◽  
Early Introduction ◽  
Design Project ◽  
Design Structure ◽  
Optimization Simulation ◽  
Stochastic Time ◽  
Optimum Sequence

Background. By the mid-1990s, the importance of the early introduction of new products to both market share and profitability became fully understood. Thus, reducing product time-to-market became an essential requirement for continuous competition. Coupled with the fact that about 70% of the life cycle cost of a product is committed at early design phases, the motivation for developing and implementing more effective methodologies for managing the design process of new product development projects became very strong. Method of Approach. One tool that helps in understanding and analyzing such a project is the design structure matrix (DSM). This paper presents a framework that obtains an optimum sequence of project activities—presented by the DSM—that minimizes total time and cost given stochastic activity estimated time and cost. The framework interfaces a meta-heuristic optimization algorithm called simulated annealing with a commercial risk analysis software. Results. The proposed framework was applied to a design project and the results have shown a robust solution minimum was reached. Conclusions. Since much of the time and cost involved in the design process is attributable to its expensive iterative nature. The framework presented in this paper improves a design project via obtaining an optimum sequence of its activities that minimizes total time and cost.

Sign in / Sign up

Export Citation Format

Share Document