Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 56 for “"Heuristic procedures"”.
-
Heuristic procedures for project scheduling under a limited resource
… Therefore attention has been focused on heuristic procedures for solving such problems. This dissertation presents a heuristic procedure (SEARCH) for project scheduling under single resource constraint. The procedure takes into consideration three basic factors in deciding the priority of …
-
Heuristic Procedures to Solve Sequencing and Scheduling Problems in Automobile Industry
… often need to be considered. A general heuristic procedure is developed for sequencing automobile assembly lines considering multiple options. The procedure uses the construction, swapping, and re-sequencing steps, and a limited search for sequencing automobile assembly lines considering …
-
Teaching Invention by Heuristic Procedures: A Model for High School Composition
Made available in DSpace on 2014-12-10T19:35:43Z (GMT). No. of bitstreams: 1 7414532.pdf: 13068997 bytes, checksum: e48b0dd6d402eb94529ecedcf68b5795 (MD5) Previous issue date: 1974
-
Comparisons of heuristic procedures for the N job M machine flowshop scheduling problem
Includes bibliographical references (pages 290-305).
-
Application of system methodologies to scheduling
… techniques are applied in combination with the heuristic procedures and primarily used to increase the effectiveness of heuristic procedures. The system methodologies considered relate the interactions in a dynamic job shop to the problem of coordination among the decision-making units (i.e., …
-
Composition heuristics and theories and a proposed heuristic for business writing
This work questions the usefulness of heuristic procedures, within composition in general writing in business in particular, as an effective aid to the generation of written, non-fiction discourse.
-
Composition heuristics and theories and a proposed heuristic for business writing
This work questions the usefulness of heuristic procedures, within composition in general writing in business in particular, as an effective aid to the generation of written, non-fiction discourse.
-
Investigating some heuristic solutions for the two-dimensional cutting stock problem
… sufficient to accommodate all the small items. A heuristic procedure is developed to solve the two-dimensional single stock-size cutting stock problem (2DSSSCSP). This is the special case where the large rectangles are all of the same size. The major objective is to minimize waste and the number …
-
A Survey of School Bus Scheduling and Routing: Criteria, Methods, and Applications
… bounded algorithm exists). However a variety of heuristic procedures can give near-optimal solutions. A survey and comparison of previous work in school bus routing is presented here.
-
Single-machine scheduling of customer orders with restrictions on the number of active orders
… primary objective of this research is to develop heuristic procedures and dispatching rules to schedule production in dynamic multi-machine environment with the objective of minimizing total costs consisting of setup costs and earliness/tardiness penalties under storage space restrictions for …
-
Synthesis heuristics for large asynchronous sequential circuits
"Many well-known synthesis procedures for asynchronous sequential circuits produce minimal or near-minimal results, but are practical only for very small problems. These algorithms become unwieldy when applied to "large" circuits with, for example, three or more input variables and twenty or more …
-
Algoritmos exatos e heurísticos para o problema da diversidade máxima
… suggest Branch-and-Cut algorithms and Lagrangian heuristics for the Maximum Diversity Problem. We use a standard formulation reinforced by some valid inequalities for the problem. These are dynamically dualized in the heuristics and used as cuts in the exact methods. To separate them efficiently, …
-
2-period travelling salesman problem
… by exactly one tour.</p><p>Optimal solution procedures are developed for examples of the problem. These procedures are based on integer programming formulations. These formulations are solved directly for small problems. The solution of medium sized problems, up to 100 nodes, requires LP …
-
Algorithms and heuristics for time-window-constrained traveling salesman problems
… at a cost. For both cases, we develop several heuristic procedures, including some that are based on Stewards [Ref-6] effective heuristics for the traveling salesman problem without time-window constraints. In addition, we develop exact algorithms for each case, which are based on the …
-
Heuristics for solving problem of evacuating non-ambulatory people in a short-notice disaster
… elite ants, ranked contribution system, and heuristic procedures during route construction. Using a Nearly-Orthogonal Latin Hypercubes (NOLH) experimental design, the algorithm parameters are tuned for best empirical performance for a range of test scenarios.
-
Design of Minimal Programmable Logic Arrays
… PLA design. A number of different minimization procedures have appeared. However, until recently, the application of these minimization procedures has been limited to functions of a few variables. For the automated design of PLA's, we need computationally efficient procedures that can minimize …
-
Optimization and Heuristic Facility Location Algorithms for the Smart Grid
… which is accomplished by using two different heuristic algorithms, K-Median and K-Center heuristic algorithms. A limited number of PMUs will be used such that all nodes are served efficiently. Further, we will compare the time taken for the optimization and heuristic procedures of both …
-
The Minimum Flow Cost Hamiltonian Tour Problem
… also develop some approximate and exact solution procedures to solve the FCHT. We present a combinatorial bound and two heuristic procedures: a greedy deterministic method and a greedy randomized adaptive search procedure. Finally, a branch-and-cut algorithm is also proposed to solve the problem …
-
Comparison of ways to use weighted factors for developing vehicle schedules in a mass transit system.
… the minimum cost flow structure is lost. Two heuristic procedures, a matching- based procedure and a time increment procedure, are developed for scheduling a fleet of vehicles under these additional constraints. These procedures attempt to minimize the average number of lines a vehicle block …
-
Mathematical models for the deterministic, capacitated, single kanban system.
… two models. The conditions are used to develop heuristic and optimal solution procedures. The heuristic procedures are tested over randomly generated problems and are shown to perform very well compared to the optimal solution procedures.
Page 1 of 3