Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Design Of Time-Phased Critical Path Scheduling Logic In Remanufacturing Material Requirements Planning, Gerald E. Tucker
Design Of Time-Phased Critical Path Scheduling Logic In Remanufacturing Material Requirements Planning, Gerald E. Tucker
Theses and Dissertations
This thesis develops and presents a new remanufacturing MRP time-phased scheduling algorithm utilizing a critical path concept, as in the project management field, for incorporation into remanufacturing production planning MRP calculations. The algorithm automates the remanufacturing lead time allowance calculation for child subassemblies and component parts in the form of Stack Time, and as such creates a linkage between the parent remanufacturing routing operation to which a remanufactured subassembly or component part is allocated for further processing, and the parent routing operation from which it is disassembled. This new MRP scheduling algorithm is optimal for calculating the total planned production …
The Four-Day School Week: Impact On Student Academic Performance, Paul M. Hewitt, George S. Denny
The Four-Day School Week: Impact On Student Academic Performance, Paul M. Hewitt, George S. Denny
The Rural Educator
Although the four-day school week originated in 1936, it was not widely implemented until 1973 when there was a need to conserve energy and reduce operating costs. This study investigated how achievement tests scores of schools with a four-day school week compared with schools with a traditional five-day school week. The study focused on student performance in Colorado where 62 school districts operated a four-day school week. The results of the Colorado Student Assessment Program (CSAP) were utilized to examine student performance in reading, writing, and mathematics in grades 3 through 10. While the mean test scores for five-day week …
Heuristic Approaches For Crane Scheduling In Ship Building, Charlie Hsiao Kuang Wen
Heuristic Approaches For Crane Scheduling In Ship Building, Charlie Hsiao Kuang Wen
Theses and Dissertations
This study provides heuristic approaches, including an ant colony optimization (ACO) inspired heuristic, to solve a crane scheduling problem that exists in most shipyards, where cranes are a primary means of processing and handling materials. Cranes move on a network of tracks, thus, blocking of crane movements is an issue. The crane scheduling problem consists of two major sub-problems: scheduling problem that determines the best overall order in which jobs are to be performed; the assignment problem that assigns cranes to jobs. The proposed heuristic consists of an Earliest Due Date sorting procedure in combination with an ACO assignment procedure …
Modeling Of An Adaptive Parallel System With Malleable Applications In A Distributed Computing Environment, Sheikh Khaled Ghafoor
Modeling Of An Adaptive Parallel System With Malleable Applications In A Distributed Computing Environment, Sheikh Khaled Ghafoor
Theses and Dissertations
Adaptive parallel applications that can change resources during execution, promise increased application performance and better system utilization. Furthermore, they open the opportunity for developing a new class of parallel applications driven by unpredictable data and events. The research issues in an adaptive parallel system are complex and interrelated. The nature and complexities of the relationships among these issues are not well researched and understood. Before developing adaptive applications or an infrastructure support for adaptive applications, these issues need to be investigated and studied in detail. One way of understanding and investigating these issues is by modeling and simulation. A model …
Approximate Methods For Solving Flowshop Problems, Pramod Jain
Approximate Methods For Solving Flowshop Problems, Pramod Jain
Theses and Dissertations
The flow shop scheduling problem is a classical combinatorial problem being studied for years. The focus of this research is to study two variants of the flow shop scheduling problem in order to minimize makespan by scheduling n jobs on m machines. A solution approach is developed for the modified flow shop problem with due dates and release times. This algorithm is an attempt to contribute to the limited literature for the problem. Another tabu search-based solution approach is developed to solve the classical flow shop scheduling problem. This meta-heuristic (called 3XTS) allows an efficient search of the neighboring solutions …