Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Entire DC Network
In-House Development Of Scheduling Decision Support Systems: Case Study For Scheduling Semiconductor Device Test Operations, Tali Freed, K. H. Doerr, T. Chang
In-House Development Of Scheduling Decision Support Systems: Case Study For Scheduling Semiconductor Device Test Operations, Tali Freed, K. H. Doerr, T. Chang
Industrial and Manufacturing Engineering
Most manufacturing processes can benefit from an automated scheduling system. However;: the design of a fast, computerised scheduling system that achieves high-quality results and requires minimal resources is a difficult undertaking. Efficient .. scheduling of a semiconductor device test facility requires an information system that provides good schedules quickly. Semiconductor device testing-is the last stage of the long semiconductor manufacturing process, and therefore. is subjected to customer service pressures. The cost of an off-the-shelf computerised scheduling system may he prohibitive for many companies. In addition, many companies are taken aback by other characteristics of off-the-shelf scheduling systems, such as code …
Optimal Scheduling Of Generator Maintenance Using Modified Discrete Particle Swarm Optimization, Yusuf Yare, Ganesh K. Venayagamoorthy
Optimal Scheduling Of Generator Maintenance Using Modified Discrete Particle Swarm Optimization, Yusuf Yare, Ganesh K. Venayagamoorthy
Electrical and Computer Engineering Faculty Research & Creative Works
This paper presents a modified discrete particle swarm optimization (PSO) based technique for generating optimal preventive maintenance schedule of generating units for economical and reliable operation of a power system while satisfying system load demand and crew constraints. While GA and other analytical methods might suffer from premature convergence and the curse of dimensionality, heuristics based swarm intelligence can be an efficient alternative. PSO is known to effectively solve large scale multi-objective optimization problems. Here, a modified discrete PSO approach is proposed for the GMS optimization problem in order to overcome the limitations of the conventional methods and come up …
Cost Estimating Certifications Offered By Professional Societies In The United States And Abroad, Donald S. Remer, Karen Ahle, Kevin Alley, John Silny, Karen Hsin, Elijah Kwitman, Allison Hutchings
Cost Estimating Certifications Offered By Professional Societies In The United States And Abroad, Donald S. Remer, Karen Ahle, Kevin Alley, John Silny, Karen Hsin, Elijah Kwitman, Allison Hutchings
All HMC Faculty Publications and Research
Many projects in industry and government go over budget and schedule. In most engineering economics courses, the emphasis is on how to compare alternatives and learn about time value of money and interest and inflation rates. The students are usually given the costs and asked to compare the alternatives. However, this is the easy part of the analysis. The hard part of real project evaluations is developing the cost and investment numbers to do the engineering economics analysis. In most engineering economic textbooks, there is at most one chapter on cost estimation. More and more companies and government organizations are …
Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau
Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposed into two subproblems—sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an executable schedule from the semi-schedule via idle-time insertion. Sequencing is strongly NP-hard in general. Although timetabling is polynomial-time solvable, it can become a computational bottleneck if the procedure is executed many times within a larger framework. This paper makes two contributions. We …
Primecontract.Com, Purdue Ect Team
Primecontract.Com, Purdue Ect Team
ECT Fact Sheets
The PrimeContract.com network is based on a three-tier software architecture using JAVA in a UNIX environment. The network is designed to effortlessly accommodate large numbers of users in an extremely secure environment.
Dynamic Voltage Scaling For Priority-Driven Scheduled Distributed Real-Time Systems, Chenxing Wang
Dynamic Voltage Scaling For Priority-Driven Scheduled Distributed Real-Time Systems, Chenxing Wang
University of Kentucky Doctoral Dissertations
Energy consumption is increasingly affecting battery life and cooling for real- time systems. Dynamic Voltage and frequency Scaling (DVS) has been shown to substantially reduce the energy consumption of uniprocessor real-time systems. It is worthwhile to extend the efficient DVS scheduling algorithms to distributed system with dependent tasks. The dissertation describes how to extend several effective uniprocessor DVS schedul- ing algorithms to distributed system with dependent task set. Task assignment and deadline assignment heuristics are proposed and compared with existing heuristics concerning energy-conserving performance. An admission test and a deadline com- putation algorithm are presented in the dissertation for dynamic …
Exact And Heuristic Algorithms For The Job Shop Scheduling Problem With Earliness And Tardiness Over A Common Due Date, Leonardo Bedoya-Valencia
Exact And Heuristic Algorithms For The Job Shop Scheduling Problem With Earliness And Tardiness Over A Common Due Date, Leonardo Bedoya-Valencia
Engineering Management & Systems Engineering Theses & Dissertations
Scheduling has turned out to be a fundamental activity for both production and service organizations. As competitive markets emerge, Just-In-Time (JIT) production has obtained more importance as a way of rapidly responding to continuously changing market forces. Due to their realistic assumptions, job shop production environments have gained much research effort among scheduling researchers. This research develops exact and heuristic methods and algorithms to solve the job shop scheduling problem when the objective is to minimize both earliness and tardiness costs over a common due date. The objective function of minimizing earliness and tardiness costs captures the essence of the …