Downloads & Free Reading Options - Results

IV, 326pp

Includes bibliographical references and indexes

Includes bibliographical references and indexes

A step-by-step process is described for registering students in junior and senior high schools by electronic computer and for providing them with conflict-free programs. The manual provides answers to questions concerning procedure, outlines features to improve administrative control, depicts various forms of data processing materials used, and enumerates various types of results. Directions are given for data preparation, with examples of forms used for course coding, student identification numbers, course requests, registration summation and conflict analysis, master schedule description, and student program adjustment. Sample lists of both junior and senior high school course offerings are appended. (JK)

A step-by-step process is described for registering students in junior and senior high schools by electronic computer and for providing them with conflict-free programs. The manual provides answers to questions concerning procedure, outlines features to improve administrative control, depicts various forms of data processing materials used, and enumerates various types of results. Directions are given for data preparation, with examples of forms used for course coding, student identification numbers, course requests, registration summation and conflict analysis, master schedule description, and student program adjustment. Sample lists of both junior and senior high school course offerings are appended. (JK)

A step-by-step process is described for registering students in junior and senior high schools by electronic computer and for providing them with conflict-free programs. The manual provides answers to questions concerning procedure, outlines features to improve administrative control, depicts various forms of data processing materials used, and enumerates various types of results. Directions are given for data preparation, with examples of forms used for course coding, student identification numbers, course requests, registration summation and conflict analysis, master schedule description, and student program adjustment. Sample lists of both junior and senior high school course offerings are appended. (JK)

The major suppliers of commercially available project management software were identified. These suppliers were surveyed to ascertain the nature of the time constrained and resource constrained scheduling effectiveness provided by the software. The survey also identifies the major features of the software as well as the minimum and recommended computer hardware requirements for the software. The software suppliers were all provided with the same sample network for time constrained and resource constrained scheduling. The results of the scheduling calculations are analyzed to evaluate the effectiveness of the software's procedures. No specific recommendations or opinions are given concerning any of the individual software products or suppliers

381 pages : 28 cm

Modern construction system has shown great potential in the field of the conventional construction system. The advantage of using new construction techniques for any type of construction is that the process takes no longer. The modern method of construction is defined as a way of working more effectively to achieve more while using less. The description lends itself heavily to offsite or modular construction techniques the method of prefabricating parts of building offsite before transporting and assembling them at their final location. Unlike traditional methods of construction is defined as a way of working more effectively. Poor construction management will cause the delay. Delay in the contracted project can result in penalties and adversely affect the reputation of the company. It is essential to manage the work within time. If construction time increases, construction cost also increases. It is necessary proper planning and management for construction work. Primavera p6 is a management tool. In this study primavera software help in the planning and scheduling of the project. Primavera gives better quality of project management process and easily understanding results. Shashwat Dubey | Prof. M. C. Paliwal "Review on Planning and Scheduling of Construction Project by Management Tool Primavera P6" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-2 , February 2021, URL: https://www.ijtsrd.com/papers/ijtsrd38641.pdf Paper Url: https://www.ijtsrd.com/engineering/civil-engineering/38641/review-on-planning-and-scheduling-of-construction-project-by-management-tool-primavera-p6/shashwat-dubey

Modern construction system has shown great potential in the field of the conventional construction system. The advantage of using new construction techniques for any type of construction is that the process takes no longer. The modern method of construction is defined as a way of working more effectively to achieve more while using less. The description lends itself heavily to offsite or modular construction techniques the method of prefabricating parts of building offsite before transporting and assembling them at their final location. Unlike traditional methods of construction is defined as a way of working more effectively. Poor construction management will cause the delay. Delay in the contracted project can result in penalties and adversely affect the reputation of the company. It is essential to manage the work within time. If construction time increases, construction cost also increases. It is necessary proper planning and management for construction work. Primavera p6 is a management tool. In this study primavera software help in the planning and scheduling of the project. Primavera gives better quality of project management process and easily understanding results. Shashwat Dubey | Prof. M. C. Paliwal "Review on Planning and Scheduling of Construction Project by Management Tool Primavera P6" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-2 , February 2021, URL: https://www.ijtsrd.com/papers/ijtsrd38641.pdf Paper Url: https://www.ijtsrd.com/engineering/civil-engineering/38641/review-on-planning-and-scheduling-of-construction-project-by-management-tool-primavera-p6/shashwat-dubey

In this paper, we address a new problem in the context of project payment scheduling when project activities are allowed to be crashed with the purpose of maximizing the contractors net present value (NPV). We assume that the contractor is paid at some pre-specified points of time according to the volume of work performed. Upon completion of activities, the cost of their execution is paid. Two different approaches are used to determine the volume of work performed at so called review points. In the first approach, only completed activities are considered. In the second approach, any portions of the activities that are executed are considered. To increase the volume of work performed at the review points, the contractor may decide to crash some activities and as such possibly increases his NPV. As activity crashing costs the contractor money, a compromise needs to be made. Two mathematical models are developed to study each approach and hence help the contractor to make the best decision. These models offer a means of investigating whether it is advisable to crash some activities and are therefore of practical importance. It is shown that the contractor may increase his NPV, even when he pays for the activity crashing costs. The performance of the mathematical models is illustrated using a numerical example.

In this paper, we address a new problem in the context of project payment scheduling when project activities are allowed to be crashed with the purpose of maximizing the contractors net present value (NPV). We assume that the contractor is paid at some pre-specified points of time according to the volume of work performed. Upon completion of activities, the cost of their execution is paid. Two different approaches are used to determine the volume of work performed at so called review points. In the first approach, only completed activities are considered. In the second approach, any portions of the activities that are executed are considered. To increase the volume of work performed at the review points, the contractor may decide to crash some activities and as such possibly increases his NPV. As activity crashing costs the contractor money, a compromise needs to be made. Two mathematical models are developed to study each approach and hence help the contractor to make the best decision. These models offer a means of investigating whether it is advisable to crash some activities and are therefore of practical importance. It is shown that the contractor may increase his NPV, even when he pays for the activity crashing costs. The performance of the mathematical models is illustrated using a numerical example.

In this paper, we address a new problem in the context of project payment scheduling when project activities are allowed to be crashed with the purpose of maximizing the contractors net present value (NPV). We assume that the contractor is paid at some pre-specified points of time according to the volume of work performed. Upon completion of activities, the cost of their execution is paid. Two different approaches are used to determine the volume of work performed at so called review points. In the first approach, only completed activities are considered. In the second approach, any portions of the activities that are executed are considered. To increase the volume of work performed at the review points, the contractor may decide to crash some activities and as such possibly increases his NPV. As activity crashing costs the contractor money, a compromise needs to be made. Two mathematical models are developed to study each approach and hence help the contractor to make the best decision. These models offer a means of investigating whether it is advisable to crash some activities and are therefore of practical importance. It is shown that the contractor may increase his NPV, even when he pays for the activity crashing costs. The performance of the mathematical models is illustrated using a numerical example.

In this paper, we address a new problem in the context of project payment scheduling when project activities are allowed to be crashed with the purpose of maximizing the contractors net present value (NPV). We assume that the contractor is paid at some pre-specified points of time according to the volume of work performed. Upon completion of activities, the cost of their execution is paid. Two different approaches are used to determine the volume of work performed at so called review points. In the first approach, only completed activities are considered. In the second approach, any portions of the activities that are executed are considered. To increase the volume of work performed at the review points, the contractor may decide to crash some activities and as such possibly increases his NPV. As activity crashing costs the contractor money, a compromise needs to be made. Two mathematical models are developed to study each approach and hence help the contractor to make the best decision. These models offer a means of investigating whether it is advisable to crash some activities and are therefore of practical importance. It is shown that the contractor may increase his NPV, even when he pays for the activity crashing costs. The performance of the mathematical models is illustrated using a numerical example.

In this paper, we address a new problem in the context of project payment scheduling when project activities are allowed to be crashed with the purpose of maximizing the contractors net present value (NPV). We assume that the contractor is paid at some pre-specified points of time according to the volume of work performed. Upon completion of activities, the cost of their execution is paid. Two different approaches are used to determine the volume of work performed at so called review points. In the first approach, only completed activities are considered. In the second approach, any portions of the activities that are executed are considered. To increase the volume of work performed at the review points, the contractor may decide to crash some activities and as such possibly increases his NPV. As activity crashing costs the contractor money, a compromise needs to be made. Two mathematical models are developed to study each approach and hence help the contractor to make the best decision. These models offer a means of investigating whether it is advisable to crash some activities and are therefore of practical importance. It is shown that the contractor may increase his NPV, even when he pays for the activity crashing costs. The performance of the mathematical models is illustrated using a numerical example.

ADA031819

Government Publishing Office U.S. Congress Senate Committee on Appropriations A REVIEW OF THE AIRSPACE REDESIGN PROJECT AND FLIGHT SCHEDULING PRACTICES AT THE PHILADELPHIA AIRPORT Date(s) Held: 2008-04-25 110th Congress, 2nd Session GPO Document Source: CHRG-110shrg44742 Superintendents of Documents ID: Y 4.AP 6/2 Related Items: United States House Bill 1182 (110th Congress) United States Senate Bill 1300 (110th Congress)

A project scheduling algorithm is developed and illustrated. For each feasible project deadline time the minimum project cost and corresponding optimal deterministic activity durations are derived. The cost of an activity is assumed to be a convex piecewise linear function of its duration. The algorithm is based upon network-flow techniques including the use of a labeling procedure which preserves complementary slackness. A computer implementation of the algorithm is documented. (Author)

A great deal of research in activity network based project resource management seems not to have found wide spread adoption. We briefly consider why this is true and pose some new research problems. Based on a broad look at research in project resource management, one fact seems certain. All previous research has focused on a problem paradigm abstracted from its original source. Thus, no consideration is given to the problem environment. This seems to be a fundamental error. Without considering some aspects of the problem environment, how can we develop problem specific tools? Or, how can we develop general tools that will allow the manager or analyst to gain access to the general models and results in a useful and meaningful way? The abstraction from problem environment also has lead us to focus on analysis to the exclusion of synthesis. We've taken the relatively easy analysis problem and solved it in great detail, without any thought to the difficult design problem.

The major suppliers of commercially available project management software were identified. These suppliers were surveyed to ascertain the nature of the time constrained and resource constrained scheduling effectiveness provided by the software. The survey also identifies the major features of the software as well as the minimum and recommended computer hardware requirements for the software. The software suppliers were all provided with the same sample network for time constrained and resource constrained scheduling. The results of the scheduling calculations are analyzed to evaluate the effectiveness of the software's procedures. No specific recommendations or opinions are given concerning any of the individual software products or suppliers.

The major suppliers of commercially available project management software were identified. These suppliers were surveyed to ascertain the nature of the time constrained and resource constrained scheduling effectiveness provided by the software. The survey also identifies the major features of the software as well as the minimum and recommended computer hardware requirements for the software. The software suppliers were all provided with the same sample network for time constrained and resource constrained scheduling. The results of the scheduling calculations are analyzed to evaluate the effectiveness of the software's procedures. No specific recommendations or opinions are given concerning any of the individual software products or suppliers.

The demand for radiological examinations at Munson Army Community Hospital (MACH), Fort Leavenworth, Kansas, routinely exceeds the capacity of the Radiology Department because of an insufficient number of functional examination rooms. Patients and physicians complain about excessive waiting times for x- rays. Large backlogs of requests for fluoroscopic and other special radiological examinations are common. Scheduled appointments for these examinations are often booked for more than a month in advance. A new scheduling policy was initiated in October 1985 in an effort to hold the backlog of examination requests to an acceptable level. Physicians requesting examinations are to designate the maximum time the patient can wait for an appointment. If an appointment is not available within that time period, the patient is automatically sent to another hospital--usually the Veterans Administration Medical Center (VAMC) in Leavenworth or the Kansas University Medical Center (KUMC) in Kansas City--to undergo the examination. MACH pays for these examinations with Supplemental Care funds.

This research investigates scheduling performances of commercial project management software. It is based on difficulties that the Royal Australian Air Force experienced in evaluating microcomputer-based packages in maintenance task scheduling of aircraft undergoing Depot Level Maintenance. A literature review found only one paper quantifying commercial software performances. No standard performance metrics or test data were found. Several packages were evaluated using a common set of 110 single-project resource- constrained networks. The performance measure used was closeness to optimally minimum Total Durations. No package performed best on all problems. On average, the best produced schedules 5.2% longer than optimal, with 95 of 110 problems 0% to 10% above optimal, and values ranging from 0% to 35%. To describe software performance in terms of network characteristics, a linear regression model was proposed. A highly satisfactory fit was obtained using only 2 of the 58 network measures: SADUR (sum of all task duration) and ACONMX (resource constrainedness). Most project scheduling software is written and used assuming task durations have negligible variability, despite contrary industry experience. Rudimentary simulations examined solutions' robustness in a dynamic environment. The results indicate that actual projects will, on average, run longer than optimal deterministic schedules.

This research investigates scheduling performances of commercial project management software. It is based on difficulties that the Royal Australian Air Force experienced in evaluating microcomputer-based packages in maintenance task scheduling of aircraft undergoing Depot Level Maintenance. A literature review found only one paper quantifying commercial software performances. No standard performance metrics or test data were found. Several packages were evaluated using a common set of 110 single-project resource- constrained networks. The performance measure used was closeness to optimally minimum Total Durations. No package performed best on all problems. On average, the best produced schedules 5.2% longer than optimal, with 95 of 110 problems 0% to 10% above optimal, and values ranging from 0% to 35%. To describe software performance in terms of network characteristics, a linear regression model was proposed. A highly satisfactory fit was obtained using only 2 of the 58 network measures: SADUR (sum of all task duration) and ACONMX (resource constrainedness). Most project scheduling software is written and used assuming task durations have negligible variability, despite contrary industry experience. Rudimentary simulations examined solutions' robustness in a dynamic environment. The results indicate that actual projects will, on average, run longer than optimal deterministic schedules.

This research investigates scheduling performances of commercial project management software. It is based on difficulties that the Royal Australian Air Force experienced in evaluating microcomputer-based packages in maintenance task scheduling of aircraft undergoing Depot Level Maintenance. A literature review found only one paper quantifying commercial software performances. No standard performance metrics or test data were found. Several packages were evaluated using a common set of 110 single-project resource- constrained networks. The performance measure used was closeness to optimally minimum Total Durations. No package performed best on all problems. On average, the best produced schedules 5.2% longer than optimal, with 95 of 110 problems 0% to 10% above optimal, and values ranging from 0% to 35%. To describe software performance in terms of network characteristics, a linear regression model was proposed. A highly satisfactory fit was obtained using only 2 of the 58 network measures: SADUR (sum of all task duration) and ACONMX (resource constrainedness). Most project scheduling software is written and used assuming task durations have negligible variability, despite contrary industry experience. Rudimentary simulations examined solutions' robustness in a dynamic environment. The results indicate that actual projects will, on average, run longer than optimal deterministic schedules.

Philip Morris Records; email

Philip Morris Records; email

Philip Morris Records; email

Philip Morris Records; email

Philip Morris Records; email

The common presuppositions and limitations regarding the Resource Constrained Project Scheduling Problem (RCPSP) were investigated in addition to their reliability in modeling in order to investigate the possibility of   availability of renewable resources using a new attitude. The objective of modeling RCPSP was the quantification of total costs and minimization of delays in projects. Hence, in order to mathematically model RCPSP, the first non-linear complex integer math programming was transformed into a linear programming model using the features of exponential functions. To solve the final linear math problem, some experimental examples were designed in different dimensions aiming to study the performance and efficiency of the designed model. For solving low-dimension problems, the exact (epsilon) constraint multi-objective optimization method was used in the Lingo software. A meta-heuristic algorithm called NSGA-II was employed to find solutions for high-dimension problems that the Exact method could not solve. The results of using these algorithms and the statistical analysis (with 95% reliability) indicated that the performance was suitable for the Genetic Algorithm (GA). The calculation error between the Exact method and the meta-heuristic method for the three target categories of total cost, time delay, and reliability was calculated based on the obtained results. The number of errors in calculating the total cost was 26%, 19%, and 5%, respectively. Also, the delay objective function error was equal to 28%, 24%, 12 %, and 14%, respectively. Finally, the reliability objective function error value was equal to 8%, 3%, 29%, and 36%, respectively. Accordingly, it can be concluded that this meta-heuristic algorithm (GA) has more efficiency and more apposite performance for the recommended model compared with the Exact optimization software. The use of the math model designed in this study can result in decreasing the time delays in projects and the costs of scheduling problems, as well as increasing the reliability in multi-mode activities.

The field of project scheduling has received a great deal of study for many years with a steady evolution of problem complexity and solution methodologies. As solution methodologies and technologies improve, increasingly complex, real-world problems are addressed, presenting researchers a continuing challenge to find ever more effective means for approaching project scheduling. This dissertation introduces a project scheduling problem which is applicable across a broad spectrum of real-world situations. The problem is based on the well-known Resource-Constrained Project Scheduling Problem, extended to include multiple modes, generalized precedence, and expediting resources. The problem is further extended to include multiple projects which have generalized precedence, renewable and nonrenewable resources, and expediting resources at the program level. The problem presented is one not previously addressed in the literature nor is it one to which the existing specialized project scheduling methodologies can be directly applied. This dissertation presents a decomposition approach for solving the problem, including algorithms for solving the decomposed subproblems and the master problem. This dissertation also describes a methodology for generating instances of the new problem, extending the way existing problem generators describe and construct network structures and this class of problem. The methodologies presented are demonstrated through extensive empirical testing.

The field of project scheduling has received a great deal of study for many years with a steady evolution of problem complexity and solution methodologies. As solution methodologies and technologies improve, increasingly complex, real-world problems are addressed, presenting researchers a continuing challenge to find ever more effective means for approaching project scheduling. This dissertation introduces a project scheduling problem which is applicable across a broad spectrum of real-world situations. The problem is based on the well-known Resource-Constrained Project Scheduling Problem, extended to include multiple modes, generalized precedence, and expediting resources. The problem is further extended to include multiple projects which have generalized precedence, renewable and nonrenewable resources, and expediting resources at the program level. The problem presented is one not previously addressed in the literature nor is it one to which the existing specialized project scheduling methodologies can be directly applied. This dissertation presents a decomposition approach for solving the problem, including algorithms for solving the decomposed subproblems and the master problem. This dissertation also describes a methodology for generating instances of the new problem, extending the way existing problem generators describe and construct network structures and this class of problem. The methodologies presented are demonstrated through extensive empirical testing.

The field of project scheduling has received a great deal of study for many years with a steady evolution of problem complexity and solution methodologies. As solution methodologies and technologies improve, increasingly complex, real-world problems are addressed, presenting researchers a continuing challenge to find ever more effective means for approaching project scheduling. This dissertation introduces a project scheduling problem which is applicable across a broad spectrum of real-world situations. The problem is based on the well-known Resource-Constrained Project Scheduling Problem, extended to include multiple modes, generalized precedence, and expediting resources. The problem is further extended to include multiple projects which have generalized precedence, renewable and nonrenewable resources, and expediting resources at the program level. The problem presented is one not previously addressed in the literature nor is it one to which the existing specialized project scheduling methodologies can be directly applied. This dissertation presents a decomposition approach for solving the problem, including algorithms for solving the decomposed subproblems and the master problem. This dissertation also describes a methodology for generating instances of the new problem, extending the way existing problem generators describe and construct network structures and this class of problem. The methodologies presented are demonstrated through extensive empirical testing.

Topics addressed include: Planning and scheduling training for working project teams at NASA, overview of project planning and scheduling workshops, project planning at NASA, new approaches to systems engineering, software reliability assessment, and software reuse in wind tunnel control systems.

This thesis details a new method of scheduling project activities in project-oriented production system can be characterized as a part of the hierarchical planning and scheduling process in which an aggregate planning level allocates resources among projects of the production system and specifies major due dates of project executions. The goal of project scheduling is to minimize the project completion time subject to resource capacities and due dates which are specified by the aggregate planning level. Resource capacities for a particular project are time varying but inflexible at any particular time. The method of scheduling aims to reflect the characteristics of work in ship overhauls in a shipyard which is believed to be a typical example of a project oriented production system. The method is designed to be computationally feasible and managerially practical. Although there are various methods and techniques for project scheduling which have been proposed in the literature, none fulfills the needs posed by the shipyard's scheduling problem. Additional keywords: algorithms; resource management; ship overhauling.

— There are two common used methods to find the minimum completion time for a project scheduling. These methods are Critical Path Method (CPM) and Program Evaluation Review Technique (PERT). In CPM, a network diagram, which is Activity on Node (AON), is drawn and the slack time for every activity is calculated such that the project's critical path could be found. It is important that the critical path can suggest the shortest possible completion time. On the other hand, PERT concerns on uncertainty and risk in a project. It has three time estimates, which are optimistic, pessimistic and most likely, and all the time estimates mentioned follows the beta distribution. Besides, the probability in completing the project within certain duration is calculated by using the standard normal distribution. As the risk cannot be avoided in a project, it is important to keep track on any changes and to minimize the completion time for a project. Both of the methods are used to calculate the shortest possible completion time, slack and critical path. The difference between these methods is CPM has only one determined time estimate, while PERT has three time estimates, which shows the uncertainty in the duration of an activity in a project. For illustration, the data used for the construction of a three-room house was studied. The results show that the minimum completion time for the project is 44 days with a success probability 0.91. In conclusion, CPM and PERT are practical tool in the project scheduling.

This research found, in general, that different project arrival distributions do affect the performance of scheduling heuristics and due date setting rules in an absolute sense, but not in a relative sense. Because of this, the project manager does not really need to be concerned about the arrival distribution of new projects. The best results are obtained when the Scheduled Finish project managers could implement this procedure due to the constraints, etc.. If they could use the SFT rule to set the due date of the arriving project, they would be wise to use the very simple First-In-First Served (FIFS) scheduling heuristic to allocate resources to the project. This research has determined that the relative performance of the tested scheduling heuristics and due data setting rules is unaffected by the project arrival distribution. (Theses)

A project scheduling problem consists of a finite set of jobs, each with fixed integer duration, requiring one or more resources such as personnel or equipment, and each subject to a set of precedence relations, which specify allowable job orderings, and a set of mutual exclusion relations, which specify jobs that cannot overlap. No job can be interrupted once started. The objective is to minimize project duration. This objective arises in nearly every large construction project--from software to hardware to buildings. Because such project scheduling problems are NP-hard, they are typically solved by branch-and-bound algorithms. In these algorithms, lower-bound duration estimates (admissible heuristics) are used to improve efficiency. One way to obtain an admissible heuristic is to remove (abstract) all resources and mutual exclusion constraints and then obtain the minimal project duration for the abstracted problem; this minimal duration is the admissible heuristic. Although such abstracted problems can be solved efficiently, they yield inaccurate admissible heuristics precisely because those constraints that are central to solving the original problem are abstracted. This paper describes a method to reconstitute the abstracted constraints back into the solution to the abstracted problem while maintaining efficiency, thereby generating better admissible heuristics. Our results suggest that reconstitution can make good admissible heuristics even better.

The technical report presents a generic exact solution approach for minimizing the project duration of the resource-constrained project scheduling problem with generalized precedences (Rcpsp/max). The approach uses lazy clause generation, i.e., a hybrid of finite domain and Boolean satisfiability solving, in order to apply nogood learning and conflict-driven search on the solution generation. Our experiments show the benefit of lazy clause generation for finding an optimal solutions and proving its optimality in comparison to other state-of-the-art exact and non-exact methods. The method is highly robust: it matched or bettered the best known results on all of the 2340 instances we examined except 3, according to the currently available data on the PSPLib. Of the 631 open instances in this set it closed 573 and improved the bounds of 51 of the remaining 58 instances.

We consider a project that consists of activities to be performed in parallel under various temporal constraints, which include start-start, start-finish and finish-start precedence relationships, release times, deadlines, and due dates. Scheduling problems are formulated to find optimal schedules for the project with respect to different objective functions to be minimized, such as the project makespan, the maximum deviation from the due dates, the maximum flow-time, and the maximum deviation of finish times. We represent these problems as optimization problems in terms of tropical mathematics, and then solve them by applying direct solution methods of tropical optimization. As a result, new direct solutions of the scheduling problems are obtained in a compact vector form, which is ready for further analysis and practical implementation. The solutions are illustrated by simple numerical examples.

We examine an optimization problem in the tropical mathematics setting, which is motivated by practical problems in just-in-time scheduling. The problem is to minimize a nonlinear objective function defined through a multiplicative conjugate transposition on vectors in a finite-dimensional semimodule over a general idempotent semifield. To solve the problem, we first derive a lower bound for the objective function, and then find vectors that make the objective function equal to the bound. Under fairly general conditions, an explicit solution is given in a closed vector form. The result is applied to solve scheduling problems formulated as minimizing a function in the form of the span seminorm, subject to linear constraints. As an illustration, numerical examples of optimal scheduling are presented.

A prototype project management system was developed for the Level III Project Office for the Space Station Freedom. The main goal was to establish a framework for the Space Station Project Office whereby Project and Office Managers can jointly establish and review scheduled milestones and activities. The objective was to assist office managers in communicating their objectives, milestones, schedules, and other project information more effectively and efficiently. Consideration of sophisticated project management systems was included, but each of the systems had limitations in meeting the stated objectives.

In postattack environment, field information on mission-critical facility damage is collected and analyzed to determine structural integrity and usability. From this analysis, a repair schedule is developed. This process is time-consuming when unaided by a computerized system. Consequently, the POST-DAM system was developed to determine repair strategies using an expert system; keep track of materials and equipment using a relational database management system: and schedule repairs based on manpower and equipment availability using a project management system. This report addresses the combination of the relational database management system and the project management system of the original POST. DAM architecture into one integrated RMRS system.

This pilot project has investigated the use of engineered labor standards, specifically the MOST system, to establish standards useful for shop loading and scheduling. The key element in the investigation is the development of the nonprocess factors. The present report describes the data, procedures, and results for this development. Development of the nonprocess factors followed two parallel tracks. In the first, samples of work orders were closely monitored in the fabrication shop, and the actual production times were compared to MOST level times. Statistical and other analyses were used to develop explanations for the differences between the level times and the actual times.

This document is a user guide for the software product, the Project Scheduling Tool (version 1.4). The tool implements various mathematical Integer Linear Programming models, as well as an approach that visualises and compares model solutions. The scheduler is 'packaged' with public software to allow required calculations to be completely automated and results to be captured in both tabular and graphical form.

Proposals are presented for curriculum improvement in secondary schools. These proposals resulted from a summer workshop on modular scheduling for secondary schools held in Salem, Virginia, and concern the following areas: (1) Team teaching, (2) various sized instructional groups, (3) grouping, (4) teacher load, (5) credits, (6) marking, (7) nonscheduled time, (8) school plant facilities, (9) evaluation, and (10) time allotments. Time allotments are considered for individual courses. (HW)

In 1963 Stanford University selected Virgin Valley High School in southern Nevada as one of four pilot schools to use computerized modular scheduling. Schedules for 165 students and assignments for 14 teachers were developed at the Stanford University Computer Computation Center using 30-minute modules with a total of 80 modules per week. After one year of operation, it was found that greater opportunity existed for individualized instruction, curriculum offerings were increased, release time for teacher preparation resulted, and student and teacher attitudes toward learning improved. Reactions and responses from students and teachers concerning the use of flexible scheduling are quoted in the document. A related document is RC 001 137. (JH)

When an activity can be performed with different techniques, the activity cost function may be a discontinuous piecewise convex function of the activity's duration. This makes the determination of the minimum cost schedule satisfying a specified project deadline a nonconvex problem. However, if an activity may be performed using a combination of the different technques, the concept of a convex hull can be used to transform the activity's cost function. The resulting convex problem can be solved by the existing PERT procedures. Therefore, this paper extends the applicability of existing PERT procedures to problems with discontinuous piecewise linear or piecewise convex activity cost functions.