This dissertation provides a comprehensive analysis of the coding-spreading tradeoff problem in finite-sized synchronous direct-sequence code-division multipleaccess (DS-CDMA) systems. In contrast to the large system which has a large number of users, the finite-sized system refers to a system with a small number of users. Much work has been performed in the past on the analysis of the spectral...

We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...

the corporate entrepreneurship (ce) of firms and enterprises is the subject of current research in the fields of management and business. however, analyses on this subject in agricultural firms are lacking. the purpose of this research was to study the relationships between corporate entrepreneurship and firm performance in agricultural small and medium-sized enterprises (asmes) in iran. specif...

This chapter uses three differently sized versions of an illustrative problem that has considerable regularity, symmetry, and homogeneity in its problem environment to compare genetic programming with and without the newly developed mechanism of automatic function definition. Genetic programming with automatic function definition can automatically decompose a problem into simpler subproblems, s...

this paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. this paper presen...

in this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). no set-up is necessary between jobs belonging to the same family. a set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i  j, the duration of this set-up being the sequ...

— Using an approach that seems to be patterned after that of Yannakakis, Hofman argues that an NP-complete problem cannot be formulated as a polynomial bounded-sized linear programming problem. He then goes on to propose a " construct " that he claims to be a " counterexample " to recently published linear programming formulations of the Traveling Salesman Problem (TSP) and the Quadratic Assign...

In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. KeyWords: Linear Programming; Network Optimization; Integer Programming; Traveling Salesman Problem; Combinatorial Optimization; Scheduling; Sequencing.