31 |
Extensions of the traveling salesman problem: job sequencing with pattern constraints or due datesCash, Thomas Dalton 12 1900 (has links)
No description available.
|
32 |
Flow shop sequencing subject to a makespan constraintAndo, Naohiko 08 1900 (has links)
No description available.
|
33 |
A methodology for the implementation of computer based routingAndrus, Scot Gorden 12 1900 (has links)
No description available.
|
34 |
A PSO based load-rebalance algorithm for task-matching in large scale heterogeneous computing systemsSidhu, Manitpal S. 27 June 2013 (has links)
The idea of utilizing nature inspired algorithms to find near optimal solutions to various real world NP complete optimization problems has been extensively explored by researchers. One such problem is the task matching problem in large heterogeneous distributed computing environments like Grids and Clouds. Researchers have explored Particle Swarm Optimization(PSO), which is branch of swarm intelligence, to find a near optimal solution for the task matching problem.
In this work, I investigated the effectiveness of the smallest position value (SPV) technique in mapping the continuous version of the PSO algorithm to the task matching problem in a heterogeneous computing environment. The experimental evaluation demonstrated that the task matching generated by this technique will result in an imbalanced load distribution. In this work, I have therefore also designed a load-rebalance PSO heuristic (PSO-LR) that results in minimization of makespan and balanced utilization of the available compute nodes even in heterogeneous computing environments.
|
35 |
A PSO based load-rebalance algorithm for task-matching in large scale heterogeneous computing systemsSidhu, Manitpal S. 27 June 2013 (has links)
The idea of utilizing nature inspired algorithms to find near optimal solutions to various real world NP complete optimization problems has been extensively explored by researchers. One such problem is the task matching problem in large heterogeneous distributed computing environments like Grids and Clouds. Researchers have explored Particle Swarm Optimization(PSO), which is branch of swarm intelligence, to find a near optimal solution for the task matching problem.
In this work, I investigated the effectiveness of the smallest position value (SPV) technique in mapping the continuous version of the PSO algorithm to the task matching problem in a heterogeneous computing environment. The experimental evaluation demonstrated that the task matching generated by this technique will result in an imbalanced load distribution. In this work, I have therefore also designed a load-rebalance PSO heuristic (PSO-LR) that results in minimization of makespan and balanced utilization of the available compute nodes even in heterogeneous computing environments.
|
36 |
The development of a general algorithmic procedure for university examination timetablingIsmail, Wan Rosmanira January 1998 (has links)
The problem of scheduling university examinations is becoming difficult for examination officers especially when they have to construct the timetables manually. It is largely due to the increasing number of students and greater freedom in choosing the courses. Examination officers would have to spend a considerable amount of time checking for student conflicts so that no student would have to sit for more than one exam at any one time. There are also other limitations such as the number of examination rooms, the length of the examination period and others. The examination timetabling problem varies between institutions, depending on their particular needs and limited resources. Most of the existing computerised examination timetabling systems found in the literature are developed and used by particular institutions. Therefore, the aim of the research is to produce a general computerised system for timetabling examinations which can be used by most universities. The research is done in two stages; the first stage involves carrying out a survey on the university examination timetabling systems and the second stage is the construction of a university examination timetabler incorporating the common objectives and constraints found in the survey. The survey was carried out to determine the extent to which the computerised examination timetabling procedures are used, to identify the objectives and constraints which are commonly considered when constructing examination timetables and to evaluate the effectiveness of the existing examination timetabling systems in achieving the objectives and satisfying the constraints The construction of the general examination timetabling system is done in two parts. In the first part, a new algorithmic rule is developed to assign exams to the minimum number of sessions without creating conflicts for any student. The rule adopts a clique initialisation strategy as a starting point and a graph colouring approach for assigning the exams. This rule is also quite capable of scheduling exams to the sessions which are as close as to the least number of sessions possible, without having to carry out any backtracking process. The backtracking process can sometimes be time consuming if there are a lot of exams firstly to be scheduled, and secondly clashing with each other. The second part of the work involves minimising the total number of students taking two exams on the same day and scheduling large exams early in the examination period subject to a specified time limit on the overall examination period and a maximum number of students that may be examined in any session. A swapping rule was introduced where exams in one of the sessions in any day with large number of sameday exams are interchanged with exams in other sessions which will reduce the total number of same-day exams. The experimentation showed that if the swapping procedures are repeated three times, the total number of same-day exams will be reduced by 50%. The total number of same-day exams will be reduced even more if some extra sessions can be added to the initial minimum number of sessions. A simple rule was devised to schedule large exams early in the examination period.
|
37 |
Design and implementation of a production scheduling system for continuous manufacturing environmentRai, Nivruti 12 October 1993 (has links)
Scheduling a continuous manufacturing flow shop environment with several
machines, stochastic arrival of demands, different product requirements and limited
resources is a complex task. This research develops a methodology for scheduling
products in glass fiber industry. The system consists of two components. An optimizing
linear program determines the optimal solution for a sub-problem that accounts for
safety stocks, demands, machine capacities, and due dates. The job queues from the LP
model are then sequenced based on 'earliest job due date' for machines that have two
or more jobs to be performed on the same time. This sequenced solution is then input
to a simulation model. The simulation model prioritizes the queue of jobs on each
machine so that minimum rate of change of throughput is achieved, while satisfying the
due dates. The model was validated for a major fiber galss manufacturer. The results
show that the use of an integrated optimizing and heuristic solution system provides
better results than current scheduling practice in terms of machine utilization,
deviations from target inventories, and on-time jobs. / Graduation date: 1994
|
38 |
Structured analysis for the job shop promise dateYao, Jea-Sheng. January 1988 (has links)
Thesis (M.S.)--Ohio University, August, 1988. / Title from PDF t.p.
|
39 |
Mathematical modeling and optimal control of battlefield information flowPhillips, Donovan D. January 2008 (has links) (PDF)
Dissertation (Ph.D. in Applied Mathematics)--Naval Postgraduate School, June 2008. / Dissertation Advisor(s): Kang, Wei ; Lin, Kyle. "June 2008." Description based on title screen as viewed on August 26, 2008. Includes bibliographical references (p.141-143). Also available in print.
|
40 |
"A branch-and-bound priority rule to minimize WIP and tardiness in job-shop problem.Stithit, Wuttikorn. January 1991 (has links)
Thesis (M.S.)--Ohio University, August, 1991. / Title from PDF t.p.
|
Page generated in 0.0891 seconds