The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three examples, all of which are hard: 1) Orientation assignment for unsigned genomes. 2 ) Ortholog identification in the presence of multiple copies of genes. 3) Linearisation of partially ordered genomes. The comparison of traditional gen...

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

*This chapter presents and develops what is essentially a numerical method, making use of enumeration data, that distinguishes between models that are solvable, such as staircase polygons, and unsolvable, in a particular sense, such as self-avoiding polygons. The measure of solvability is whether the generating function is differentiably finite or not. Numerical methods are developed that allow...

Please cite this article in press as: Mahdav with Applications (2008), doi:10.1016/j.esw Cellular manufacturing (CM) is an industrial application of group technology concept. One of the problems encountered in the implementation of CM is the cell formation problem (CFP). The CFP attempted here is to group machines and parts in dedicated manufacturing cells so that the number of voids and except...

In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

In this paper, we extend techniques developed in the context of Travelling Salesperson Problem for cycle problems. Particularly, study shrinking support graphs and exact algorithms subcycle elimination separation The efficient application considered has proved to be essential when solving large size problems by Branch-and-Cut, been motivation behind work. Regarding graphs, prove validity Padber...