Digital Commons Network^™

A Genetic Algorithm For Multiobjective Hard Scheduling Optimization, Elías Niño, Carlos Ardila, Alfredo J. Perez, Yexid Donoso

Computer Science Faculty Publications

This paper proposes a genetic algorithm for multiobjective scheduling optimization based in the object oriented design with constrains on delivery times, process precedence and resource availability. Initially, the programming algorithm (PA) was designed and implemented, taking into account all constraints mentioned. This algorithm’s main objective is, given a sequence of production orders, products and processes, calculate its total programming cost and time.
Once the programming algorithm was defined, the genetic algorithm (GA) was developed for minimizing two objectives: delivery times and total programming cost. The stages defined for this algorithm were: selection, crossover and mutation. During the first stage, the …

Minimizing Makespan For Hybrid Flowshops With Batch, Discrete Processing Machines And Arbitrary Job Sizes, Yanming Zheng

FIU Electronic Theses and Dissertations

This research aims at a study of the hybrid flow shop problem which has parallel batch-processing machines in one stage and discrete-processing machines in other stages to process jobs of arbitrary sizes. The objective is to minimize the makespan for a set of jobs. The problem is denoted as: FF|batch₁, s_j|Cmax.

The problem is formulated as a mixed-integer linear program. The commercial solver, AMPL/CPLEX, is used to solve problem instances to their optimality. Experimental results show that AMPL/CPLEX requires considerable time to find the optimal solution for even a small size problem, i.e., a 6-job instance …

Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper is concerned with solving decentralized resource allocation and scheduling problems via auctions with negotiable agents by allowing agents to switch their bid generation strategies within the auction process, such that a better system wide performance is achieved on average as compared to the conventional walrasian auction running with agents of fixed bid generation strategy. We propose a negotiation mechanism embedded in auctioneer to solicit bidders’ change of strategies in the process of auction. Finally we benchmark our approach against conventional auctions subject to the real-time large-scale dynamic resource coordination problem to demonstrate the effectiveness of our approach.

A Dynamic Energy-Aware Model For Scheduling Computationally Intensive Bioinformatics Applications, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

High Performance Computing (HPC) resources are housed in large datacenters, which consume huge amounts of energy and are quickly demanding attention from businesses as they result in high operating costs. On the other hand HPC environments have been very useful to researchers in many emerging areas in life sciences such as Bioinformatics and Medical Informatics. In this paper, we provide a dynamic model for energy aware scheduling (EAS) in a HPC environment; we use a widely used bioinformatics tool named BLAT (BLAST-like alignment tool) running in a HPC environment as our case study. Our proposed EAS model incorporates 2-Phases: an …

Case Study Of Finite Resource Optimization In Fpga Using Genetic Algorithm, Jingxia Wang, Sin Ming Loo

Electrical and Computer Engineering Faculty Publications and Presentations

Modem Field-Programmable Gate Arrays (FPGAs) are becoming very popular in embedded systems and high performance applications. FPGA has benefited from the shrinking of transistor feature size, which allows more on-chip reconfigurable (e.g., memories and look-up tables) and routing resources available. Unfortunately, the amount of reconfigurable resources in a FPGA is fixed and limited. This paper investigates the mapping scheme of the applications in a FPGA by utilizing sequential processing (e.g., Altera Nios II or Xilinx Microblaze, using C programming language) and task specific hardware (using hardware description language). Genetic Algorithm is used in this study. We found that placing sequential …

Optimizing Reconfigurable Hardware Resource Usage In System-On-A-Programmable-Chip With Location-Aware Genetic Algorithm, Sin Ming Loo, Jingxia Wang

Electrical and Computer Engineering Faculty Publications and Presentations

This paper presents static task scheduling using location-aware genetic algorithm techniques to schedule task systems to finite amounts of reconfigurable hardware. This research optimizes the use of limited reconfigurable resources. This scheduling algorithm is built upon our previous work [12- 14]. In this paper, the genetic algorithm has been expanded to include a feature to assign selected tasks to specific functional units. In this reconfigurable hardware environment, multiple sequential processing elements (soft core processors such as Xilinx MicroBlaze [22] or Altera Nios-II [1]), task-specific core (application specific hardware), and communication network within the reconfigurable hardware can be used (such a …

A Hybrid Genetic Algorithm For The Student-Aware University Course Timetabling Problem, Ernesto Ferrer Queiros Nunez

Mathematics, Statistics, and Computer Science Honors Projects

Traditionally, academic institutions schedule courses using constraints that ensure that instructors and courses do not overlap in available rooms and time periods; students' planning needs are rarely taken into account. This problem becomes particularly acute for students in liberal arts institutions, because they have multiple graduation requirements in addition to their chosen academic program. My research builds on the University Course Timetabling Problem (UCTP) to include students' scheduling needs. This approach to the UCTP problem uses a combination of a genetic algorithm and case-based reasoning.

To improve the performance of the genetic algorithm, I use a group-based genetic algorithm to …

A Study Of Doubling Class Time For Low Achieving High School English And Math Students And The Impact On State Tests Required Under Nclb, Richard J. Ney

Doctoral Dissertations and Projects

The re-authorization of the Elementary and Secondary Education Act in 2002, commonly known as the No Child Left Behind Act (NCLB), increased the accountability of public schools throughout the United States, holding them individually responsible for the education levels attained by their students as measured by high stakes tests developed and administered at the state level. Administrators responded by developing programs targeted at increasing students' test scores. One program considered by administrators is the doubling of class time in math and English for students that are at risk of not succeeding. This study analyzes the viability of such a program …

Support-Based Distributed Optimisation: An Approach To Radiotherapy Patient Scheduling, Graham Billiau, Chee-Fon Chang, Andrew Alexis Miller, Aditya K. Ghose

Faculty of Informatics - Papers (Archive)

In the health system inefficiency leads to poor use of scarce expensive resources. Lengthy patient treatment waiting time can result from inefficiency in scheduling. The use of state-of-the art multi-agent and distributed computing technologies can provide a solution to address this problem. However, distributed optimisation in such a multi-agent setting poses an important challenge that requires protocols to enable agents to optimise shared objectives without necessarily revealing all of their private constraints. In this study we show that if the problem is expressed as a Dynamic Distributed Constraint Optimisation Problem a powerful algorithm such as SBDO can be deployed to …

Timing Is Affected By Demands In Memory Search But Not By Task Switching., Claudette Fortin, Richard Schweickert, Remi Gaudreault, Charles Viau-Quesnel

Department of Psychological Sciences Faculty Publications

Recent studies suggest that timing and tasks involving executive control processes might require the same attentional resources. This should lead to interference when timing and executive tasks are executed concurrently. This study examines the interference between timing and task switching, an executive function. In four experiments, memory search and digit classification were performed successively in four conditions: search-search (search followed by search), search-digit, digit-search and digit-digit. In a control reaction-time condition, participants provided RT responses in each of the two tasks. In a time-production condition, an RT response was provided to the first stimulus, but the response to the second …