Browsing by Subject "Branch and bound algorithms"
Now showing 1 - 4 of 4
Results Per Page
Sort Options
Item An exact branch and bound algorithm for the general quadratic assignment problem(Texas Tech University, 1988-12) Charnsethikul, PeerayuthThis research is concerned with the development of an exact algorithm for a general quadratic assignment problem (QAP), of which the Koopmans-Beckmann formulation, in the context of an analysis of the location of economic activities or facilities, is a special case. The algorithm is based on the linearization of a general QAP of size n into a linear assignment problem of size n(n-l)/2. The objective value and the dual solution of this subproblem are used to compute the lower bound used in an exact branch and bound procedure. Computational experience and comparisons to other well known methods are discussed.Item An investigation of the mixed-model assembly line sequencing problem(Texas Tech University, 1981-08) Kao, Chung ChiungNot availableItem Assignment models for the machine interference problem(Texas Tech University, 1983-08) Koulamas, Christos PNot availableItem On sequencing ordered matrix flowshop problems(Texas Tech University, 1974-08) Khan, Abdul WaheedIn industrial processes, several jobs are processed by the same set of machines or facilities. As a result, each job competes for the use of the available facilities. The problem is then to determine the sequence in which the jobs should be processed at each facility in order to satisfy some objective criterion. Sequencing problems can be divided into three broad categories; flowshop, job shop, and general sequencing. These categories are based on the job routing patterns in a shop. Within the flowshop category Smith [11] has defined subcategories, two of which are called "ordered matrix" and "semiordered matrix problem". This research is concerned with the ordered matrix problem. The purpose of the research is to analyze the problem with respect to three different objective criteria. These objective criteria are the minimum makespan, minimum mean completion time of jobs and minimum total tardiness of late jobs. The relevance and importance of these criteria will be discussed in subsequent chapters.